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

DOI10.1016/j.ejor.2017.04.025zbMath1375.90031OpenAlexW2606632081MaRDI QIDQ1683123

Roberto Baldacci, Edna A. Hoshino, Alessandro Hill, Andrew E. B. 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) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (5)

A branch-and-price algorithm for the ring-tree facility location problem ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ Spatial coverage in routing and path planning problems

Uses Software

• TSPLIB
• VRP

Cites Work

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

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