Heuristics for the lexicographic Max-ordering vehicle routing problem

DOI10.1007/s10100-006-0007-6zbMath1152.90581OpenAlexW1988401512MaRDI QIDQ2461267

Sleman Saliba

Publication date: 27 November 2007

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-0007-6

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Heuristics for routes generation in pickup and delivery problem ⋮ A lexicographic maximin approach to the selective assessment routing problem ⋮ A lexicographic minimax approach to the vehicle routing problem with route balancing

Uses Software

• VRP
• VRPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Multicriteria optimization
• An improved ant system algorithm for the vehicle routing problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• The Vehicle Routing Problem
• Applications of Linear Programming in the Oil Industry
• A Subpath Ejection Method for the Vehicle Routing Problem
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• Parallel iterative search methods for vehicle routing problems
• A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Heuristics for the lexicographic Max-ordering vehicle routing problem