Modeling rolling batch planning as vehicle routing problem with time windows.

DOI10.1016/S0305-0548(98)00018-5zbMath1042.90606OpenAlexW1975947586MaRDI QIDQ1406729

Xiong Chen, Weishui Wan, Xin-He Xu

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00018-5

zbMATH Keywords

vehicle routing problem with time windowsalgorithm heuristicsgeneticRolling batch planning

Mathematics Subject Classification ID

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

Related Items

STRUCTURAL AND EXTREMAL PROPERTIES OF THE HOT ROLLING BATCHES PRECEDENCE GRAPH, An economic order quantity model with completely backordering and nondecreasing demand under two-level trade credit, Scheduling in a continuous galvanizing line, Modeling and application for rolling scheduling problem based on TSP, Development of hybrid evolutionary algorithms for production scheduling of hot strip mill, An adaptive memory programming method for risk logistics operations

Uses Software

• VRP

Cites Work

• Unnamed Item
• The vehicle routing problem: An overview of exact and approximate algorithms
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• An Exchange Heuristic for Routeing Problems with Time Windows