Journal on Vehicle Routing Algorithms

ISSN: 2367-3591 (Print) 2367-3605 (Online)


A vehicle routing problem (VRP) arises whenever a set of spatially disseminated locations must be visited by mobile objects to perform tasks. The mobile objects may be motorized vehicles, pedestrians, drones, mobile sensors, or manufacturing robots; the space covered may range from silicon chips or PCBs to aircraft wings, warehouses, cities, or countries; and the applications include traditional domains, such as freight and passenger transportation, services, logistics, and manufacturing, and also modern issues such as autonomous cars and the Internet of Things (IoT), and the profound environmental and societal implications of achieving efficiencies in resources, power, labor, and time. 

Most VRPs are computationally intractable, and the field has inspired significant developments in exact algorithms and heuristics, among these sophisticated mathematical programming approaches and metaheuristics. It is an excellent domain for testing new approaches in modeling, optimization, artificial intelligence, computational intelligence, and simulation.

Articles published in the journal will present solutions, methods, algorithms, case studies, or software, attracting the interest of academic and industrial researchers, practitioners, and policymakers.

Browse Volumes & Issues