Results 311 to 320 of about 2,789,801 (380)
Some of the next articles are maybe not open access.
Deep Policy Dynamic Programming for Vehicle Routing Problems
Integration of AI and OR Techniques in Constraint Programming, 2021Routing problems are a class of combinatorial problems with many practical applications. Recently, end-to-end deep learning methods have been proposed to learn approximate solution heuristics for such problems. In contrast, classical dynamic programming (
W. Kool +3 more
semanticscholar +1 more source
A Bilevel Ant Colony Optimization Algorithm for Capacitated Electric Vehicle Routing Problem
IEEE Transactions on Cybernetics, 2021The development of electric vehicle (EV) techniques has led to a new vehicle routing problem (VRP) called the capacitated EV routing problem (CEVRP). Because of the limited number of charging stations and the limited cruising range of EVs, not only the ...
Ya-Hui Jia, Yi Mei, Mengjie Zhang
semanticscholar +1 more source
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Operational Research, 1987This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints. Given the intrinsic difficulty of this problem class, approximation methods seem to offer the most promise for practical ...
M. Solomon
semanticscholar +1 more source
The Vehicle Routeing Problem [PDF]
Logistics Information Management, 1994 Reports on a study of a vehicle routeing problem as a pilot project. Outlines the motivation to embark on such an experimental study, the data collection process, the software, and the problems detected. Summarizes the gains derived from the research and explains resistance.
Nélio Domingues Pizzolato +1 more
openaire +1 more source
IEEE Transactions on Cybernetics, 2020
Recently, evolutionary multitasking (EMT) has been proposed in the field of evolutionary computation as a new search paradigm, for solving multiple optimization tasks simultaneously.
Liang Feng +6 more
semanticscholar +1 more source
Recently, evolutionary multitasking (EMT) has been proposed in the field of evolutionary computation as a new search paradigm, for solving multiple optimization tasks simultaneously.
Liang Feng +6 more
semanticscholar +1 more source
, 2018
Vehicle routing problems (VRP) [72, 50, 186] represent one of the most investigated combinatorial optimization problems [134], due to the problem complexity and their potential impact on real-world applications especially in logistics and supply chains.
N. Pillay, R. Qu
semanticscholar +3 more sources
Vehicle routing problems (VRP) [72, 50, 186] represent one of the most investigated combinatorial optimization problems [134], due to the problem complexity and their potential impact on real-world applications especially in logistics and supply chains.
N. Pillay, R. Qu
semanticscholar +3 more sources
2016
Green vehicle routing is a branch of green logistics which refers to vehicle routing problems where externalities of using vehicles, such as carbon dioxide-equivalents emissions, are explicitly taken into account so that they are reduced through better planning. This chapter presents an overview of some of the recent developments in the area, including
Tolga Bektaş +2 more
openaire +3 more sources
Green vehicle routing is a branch of green logistics which refers to vehicle routing problems where externalities of using vehicles, such as carbon dioxide-equivalents emissions, are explicitly taken into account so that they are reduced through better planning. This chapter presents an overview of some of the recent developments in the area, including
Tolga Bektaş +2 more
openaire +3 more sources
Systems Integration '90. Proceedings of the First International Conference on Systems Integration, 2002
A general methodology for solving variations and generalizations of the vehicle routing problem (VRP) is discussed. A notation for specifying and solving a wide variety of such problems is described. The notation has two parts: a static graph-theoretic structure called a hierarchical constraint graph (HCG) and a control structure called a policy.
B. MacLeod, R. Moll
openaire +2 more sources
A general methodology for solving variations and generalizations of the vehicle routing problem (VRP) is discussed. A notation for specifying and solving a wide variety of such problems is described. The notation has two parts: a static graph-theoretic structure called a hierarchical constraint graph (HCG) and a control structure called a policy.
B. MacLeod, R. Moll
openaire +2 more sources