A mathematical formulation and an <scp>LP‐based</scp> neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem

DOI10.1002/net.22029OpenAlexW3131824739MaRDI QIDQ6065848

Unnamed Author, Unnamed Author, Masoud Yaghini

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22029

zbMATH Keywords

tabu searchhybrid methodmatheuristicrailroad blocking problemintegrated train blocking and shipment routingLP-based neighborhood search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Solving railroad blocking problem using ant colony optimization algorithm
• Constructing Railroad Blocking Plans to Minimize Handling Costs
• A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem
• Tabu Search—Part I
• Tabu Search—Part II
• Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation
• New approaches for solving the block‐to‐train assignment problem

This page was built for publication: A mathematical formulation and an <scp>LP‐based</scp> neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem