Combination of local search and CLP in the vehicle-fleet scheduling problem

DOI10.1016/S0377-2217(96)00114-2zbMath0930.90012OpenAlexW2048071200MaRDI QIDQ1278727

K. Appert

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00114-2

zbMATH Keywords

local searchconstraint logic programmingvehicle-fleet scheduling

Mathematics Subject Classification ID

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

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• ALTO: A computer system for the design of vehicle routing algorithms
• The vehicle routing problem with backhauls
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• The Truck Dispatching Problem
• Set Partitioning: A survey
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• Parallel iterative search methods for vehicle routing problems
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Solving large combinatorial problems in logic programming

This page was built for publication: Combination of local search and CLP in the vehicle-fleet scheduling problem