Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics

DOI10.1007/s10100-006-0168-3zbMath1203.90025OpenAlexW2039532120MaRDI QIDQ926347

Kenneth Sörensen

Publication date: 27 May 2008

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-006-0168-3

zbMATH Keywords

distance measurevehicle routingbi-objective optimizationroute stability

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Bi-objective bimodal urban road network design using hybrid metaheuristics ⋮ The \(k\)-dissimilar vehicle routing problem ⋮ The multiple shortest path problem with path deconfliction ⋮ A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling ⋮ Ship Routing Scheduling with Persistence and Distance Objecives

Uses Software

• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• A framework for robust and flexible optimisation using metaheuristics, with applications in supply chain design
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Algorithms and codes for dense assignment problems: The state of the art
• \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Finding approximate patterns in strings
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• Parallel iterative search methods for vehicle routing problems
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
• The String-to-String Correction Problem
• A new hybrid genetic algorithm for the capacitated vehicle routing problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• A Priori Optimization
• A Vehicle Routing Problem with Stochastic Demand