Using tabu search for solving a dynamic multi-terminal truck dispatching problem

DOI10.1016/0377-2217(95)00016-JzbMath0904.90053MaRDI QIDQ1388833

César Rego, Catherine Roucairol

Publication date: 19 January 1999

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

zbMATH Keywords

tabu searchcompound movesreal-life tank truck dispatching

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (6)

Metaheuristics: A bibliography ⋮ Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. ⋮ Solving a fuel delivery problem by heuristic and exact approaches. ⋮ Integrating purchasing and routing in a propane gas supply chain. ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ Adaptive demand peak management in online transport process planning

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• A generalized insertion algorithm for the seriation problem
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Tabu Search—Part I
• Tabu Search—Part II
• Matching, Euler tours and the Chinese postman
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Using tabu search for solving a dynamic multi-terminal truck dispatching problem