Matheuristics for the single-path design-balanced service network design problem

DOI10.1016/j.cor.2016.07.010zbMath1391.90117OpenAlexW2461425465MaRDI QIDQ1652031

Xiangyong Li, Youzhi Cui, Kai Wei, Peng Tian, Yash P. Aneja

Publication date: 11 July 2018

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

Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.010

zbMATH Keywords

local branchingservice network designdesign-balanced constraintsrelaxation induced neighborhood searchsingle-path constraints

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (3)

An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach ⋮ A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem

Uses Software

• SPOT

Cites Work

• Unnamed Item
• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• A local branching heuristic for the capacitated fixed-charge network design problem
• Local branching
• Service network design in freight transportation
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. International workshop, SLS 2007, Brussels, Belgium, September 6--8, 2007. Proceedings.
• A Survey of Optimization Models for Train Routing and Scheduling
• Tuning an Algorithm Using Design of Experiments
• Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
• Composite Variable Formulations for Express Shipment Service Network Design
• A Simplex-Based Tabu Search Method for Capacitated Network Design
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Multimodal Express Package Delivery: A Service Network Design Application
• A Simplex Method for Function Minimization
• Using experimental design to find effective parameter settings for heuristics
• Network design for express shipment delivery

This page was built for publication: Matheuristics for the single-path design-balanced service network design problem