Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms

DOI10.1016/J.EJOR.2017.04.025MaRDI QIDQ1683123zbMATH OpenOpenAlexFDO

Authors Roberto Baldacci, Alessandro Hill, Edna A. Hoshino, Andrew Lim

Publication date 6 December 2017

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

Full work available at URL https://doi.org/10.1016/j.ejor.2017.04.025

zbMATH Keywords

dynamic programminglower boundsmulti-depot ring star problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06)

Recommendations

• Column Generation Algorithms for the Capacitated m-Ring-Star Problem
• The Capacitated m-Ring-Star Problem
• An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem

Cites work

• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• A column generation approach for a school bus routing problem with resource constraints
• A heuristic procedure for the capacitated \(m\)-ring-star problem
• An exact solution framework for a broad class of vehicle routing problems
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Heuristic algorithms for the multi-depot ring-star problem
• Locating a cycle in a transportation or a telecommunications network
• New route relaxation and pricing strategies for the vehicle routing problem
• Optimal capacitated ring trees
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• TSPLIB—A Traveling Salesman Problem Library
• The Capacitated m-Ring-Star Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• The ring tree facility location problem
• The vehicle routing-allocation problem: A unifying framework

Cited in

(8)

• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem
• New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
• A branch-and-price algorithm for the ring-tree facility location problem
• A covering traveling salesman problem with profit in the last mile delivery
• Spatial coverage in routing and path planning problems
• The Capacitated m-Ring-Star Problem
• Modeling and solving the two-level generalized median tour problem

Describes a project that uses

Uses Software

• VRP
• TSPLIB

This page was built for publication: Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms

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