Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 2 of 2
Full-Text Articles in Artificial Intelligence and Robotics
Learning Ant Colony Algorithm For Green Multi-Depot Vehicle Routing Problem, Hu Rong, Wenbo Chen, Bin Qian, Guo Ning, Fenghong Xiang
Learning Ant Colony Algorithm For Green Multi-Depot Vehicle Routing Problem, Hu Rong, Wenbo Chen, Bin Qian, Guo Ning, Fenghong Xiang
Journal of System Simulation
Abstract: Considering the congested roads situation of urban central areas in China, a speed calculation method based on vehicle driving sections is designed, and a model for the Green Multi-Depot Vehicle Routing Problem with Total Fuel-Consumption cost Criterion (TFC-GMDVRP) is established, considering simultaneously the vehicle travel distance, load, and speed factors. A learning ant colony optimization algorithm (LACO), combining a knowledge model and an ant colony optimization algorithm (ACO), is proposed for solving the TFC-GMDVRP. In order to improve the performance and robustness of the algorithm's global search, the parameter knowledge that contains the different …
A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
This paper studies the integration of the vehicle routing problem with cross-docking (VRPCD). The aim is to find a set of routes to deliver products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic based on column generation is proposed. The first phase focuses on generating a set of feasible candidate routes in both pickup and delivery processes by implementing an adaptive large neighborhood search algorithm. A set of destroy and repair operators are …