A new heuristic for the fleet size and mix vehicle routing problem
Computers and Operations Research
A tabu search heuristic for the heterogenous fleet vehicle routing problem
Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Discrete Applied Mathematics
Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing)
A column generation approach to the heterogeneous fleet vehicle routing problem
Computers and Operations Research
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
Computers and Operations Research
Fda -a scalable evolutionary algorithm for the optimization of additively decomposed functions
Evolutionary Computation
| Hi-index | 0.00 |
Mismanagement of routing and deliveries between sites of the same company or toward external sites leads to consequences in the cost of transport. When shipping alternatives exist, the selection of the appropriate shipping alternative (mode) for each shipment may result in significant cost savings. In this paper, the authors examine a class of vehicle routing in which a fixed internal fleet is available at the warehouse in the presence of an external transporter. The authors describe hybrid Iterated Density Estimation Evolutionary Algorithm with 2-opt local search to determine the specific assignment of each tour to a private vehicle (internal fleet) or an outside carrier (external fleet). Experimental results show that this method is effective, allowing the discovery of new best solutions for well-known benchmarks.