A particular multiobjective vehicle routing problem solved by simulated annealing

MaRDI QIDQ4817406zbMATH OpenFDO

Authors Daniel Tuyttens, Nasser A. El-Sherbeny, Jacques Teghem

Publication date 22 September 2004

zbMATH Keywords

multiobjective problemsimulated annealingvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Review text

The authors consider a very special vehicle routing problem with several constraints and a couple of objective functions. Simulated annealing is modified to get quickly potential efficient solutions (which are not dominated by any other feasible solution generated during the procedure). The neighborhood is given by a suitable distance function (between tours) and a threshold; the selection of the next move is controlled by a partial optimization. Lower bounds are calculated, to estimate the performance of the proposal methods, and some experimental results are given. For the entire collection see [Zbl 1032.90001].

Recommendations

• Improvement heuristics for the vehicle routing problem based on simulated annealing
• A simulated-annealing method for the standard problem of vehicle routing with time window constraints
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
• scientific article; zbMATH DE number 5951619
• A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
• Solving the truck and trailer routing problem based on a simulated annealing heuristic
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Using simulated annealing to solve routing and location problems

Cited in

(16)

• A simulated annealing approach for the multi-periodic rail-car fleet sizing problem
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• Enhanced simulated annealing technique for the single-row routing problem
• Solving the shortest route cut and fill problem using simulated annealing
• The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
• Subcost-guided simulated annealing
• scientific article; zbMATH DE number 5951619 (Why is no real title available?)
• A simulated annealing for multi-criteria network path problems
• Improved load balancing and resource utilization for the skill vehicle routing problem
• A simulated-annealing method for the standard problem of vehicle routing with time window constraints
• Three parallel algorithms for simulated annealing
• Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows
• Tabu search embedded simulated annealing for the shortest route cut and fill problem
• Evolutionary Multi-Criterion Optimization
• Solving the truck and trailer routing problem based on a simulated annealing heuristic
• The museum visitor routing problem

This page was built for publication: A particular multiobjective vehicle routing problem solved by simulated annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4817406)