New Evolutionary Algorithm Based on 2-Opt Local Search to Solve the Vehicle Routing Problem with Private Fleet and Common Carrier

@article{Euchi2011NewEA,
  title={New Evolutionary Algorithm Based on 2-Opt Local Search to Solve the Vehicle Routing Problem with Private Fleet and Common Carrier},
  author={Jalel Euchi and Habib Chabchoub and Adnan Yassine},
  journal={Int. J. Appl. Metaheuristic Comput.},
  year={2011},
  volume={2},
  pages={58-82}
}
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 local search for the vehicle routing problem with a private fleet and a common carrier
TLDR
A methodology is proposed that solves the vehicle routing problem with a private fleet and a common carrier using an iterated local search algorithm, based on two concepts: intensification and diversification, which reaches in all cases the best solution reported with low computing times.
Iterated local search multi-objective methodology for the green vehicle routing problem considering workload equity with a private fleet and a common carrier
A multi-objective methodology was proposed for solving the green vehicle routing problem with a private fleet and common carrier considering workload equity. The iterated local search metaheuristic,
Hybrid estimation of distribution algorithm for a multiple trips fixed fleet vehicle routing problems with time windows
TLDR
A new hybrid evolutionary algorithm for transport optimisation problems, called estimation of distribution algorithm with local search is used, which integrates a double structure of distribution technique, which is used to introduce the variables dependency.
Metaheurística ILS para la solución del problema de ruteo de vehículos con flota propia y subcontratada VRPPC
TLDR
An approximate optimization algorithm is developed in this work, named Iterated Local Search (ILS), which implements Variable Neighborhood Search (VNS).
LITERATURE REVIEW ON THE VEHICLE ROUTING PROBLEM IN THE GREEN TRANSPORTATION CONTEXT
In the efficient management of the supply chain the optimal management of transport of consumables and finished products appears. The costs associated with transport have direct impact on the final
New Genetic Operator (Jump Crossover) for the Traveling Salesman Problem
TLDR
Experimental results show that in most cases JMPX can remarkably improve the solution quality of the GA compared to the two existing classic crossover approaches and the r-opt heuristic.
A Reinforced Tabu Search Approach for 2D Strip Packing
TLDR
The authors present a local search algorithm based on the well-known tabu search metaheuristic for two dimensional strip packing problem, where a finite set of objects have to be located in a strip of fixed width and infinite height.
...
...

References

SHOWING 1-10 OF 69 REFERENCES
A new heuristic for the fleet size and mix vehicle routing problem
A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem
TLDR
A Tabu Search algorithm embedded in the Adaptive Memory (TSAM) procedure to solve the HFFVRP, a variant of the Vehicle Routing Problem that aims to provide service to a specific customer group with minimum cost using a limited number of vehicles.
A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
TLDR
A new metaheuristic is described for the VRPPC, which uses a perturbation procedure in the construction and improvement phases and also performs exchanges between the sets of customers served by the private fleet and the common carrier.
A column generation approach to the heterogeneous fleet vehicle routing problem
Iterated Density Estimation with 2-opt local search for the vehicle routing problem with private fleet and common carrier
We describe a 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 to an
The fleet size and mix vehicle routing problem
The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results
TLDR
In the standard, capacitated vehicle routing problem (VRP), a homogeneous fleet of vehicles services a set of customers from a single depot so that all customers are serviced and the total distance traveled by the fleet is minimized.
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
...
...