A metaheuristic algorithm for a locomotive routing problem arising in the steel industry

DOI10.1016/J.EJOR.2022.11.006MaRDI QIDQ6167423zbMATH OpenFDO

Authors Baobin Huang, Lixin Tang, Roberto Baldacci, Gongshu Wang, Defeng Sun

Publication date 10 July 2023

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

Full work available at URL https://doi.org/10.1016/J.EJOR.2022.11.006

zbMATH Keywords

adaptive large neighborhood searchlast-in-first-out constraintslocal searchroutingsteel industry

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
• A general heuristic for vehicle routing problems
• A hybrid heuristic algorithm for the open-pit-mining operational planning problem
• A metaheuristic for the time-dependent pollution-routing problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• A review of planning and scheduling systems and methods for integrated steel production
• A unified exact method for solving different classes of vehicle routing problems
• A unified heuristic for a large class of vehicle routing problems with backhauls
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
• An Exchange Heuristic for Routeing Problems with Time Windows
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
• Handbook of metaheuristics
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
• Optimal torpedo scheduling
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Routing a heterogeneous fleet of vehicles
• Solving the torpedo scheduling problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The multiple vehicle pickup and delivery problem with LIFO constraints
• The pickup and delivery problem with time windows and handling operations
• The pickup and delivery problem with time windows, multiple stacks, and handling operations
• The pickup and delivery traveling salesman problem with handling costs
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• The vehicle routing problem with simultaneous pickup and delivery and handling costs
• Vehicle routing problems with loading constraints: state-of-the-art and future directions

Cited in

(1)

• Metaheuristics for meltshop scheduling in the steel industry

This page was built for publication: A metaheuristic algorithm for a locomotive routing problem arising in the steel industry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167423)