A branch and price approach for routing and refueling station location model
From MaRDI portal
Publication:320784
DOI10.1016/j.ejor.2015.05.021zbMath1346.90525OpenAlexW339885383MaRDI QIDQ320784
Barış Yıldız, Oya Ekin Karaşan, Okan Arslan
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/24147
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (18)
Branch-and-price approaches for the network design problem with relays ⋮ The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach ⋮ A learning based algorithm for drone routing ⋮ Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel ⋮ Regenerator Location Problem in Flexible Optical Networks ⋮ Exact Solution of the Evasive Flow Capturing Problem ⋮ Exact Approaches for Network Design Problems with Relays ⋮ An efficient heuristic algorithm for the alternative-fuel station location problem ⋮ Efficient and equitable transnational infrastructure planning for natural gas trucking in the European union ⋮ The electric location routing problem with time windows and partial recharging ⋮ Efficient solution approaches for locating electric vehicle fast charging stations under driving range uncertainty ⋮ Maximizing expected coverage of flow and opportunity for diversion in networked systems ⋮ Locomotive fuel management with inline refueling ⋮ The location routing problem using electric vehicles with constrained distance ⋮ A multi-stage stochastic integer programming approach for locating electric vehicle charging stations ⋮ A branch\&cut approach to recharging and refueling infrastructure planning ⋮ Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty ⋮ A Benders decomposition algorithm for the maximum availability service facility location problem
Cites Work
- Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
- Infrastructure development for conversion to environmentally friendly fuel
- A linear-time algorithm for finding optimal vehicle refueling policies
- Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
- Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
- To Fill or Not to Fill: The Gas Station Problem
- A generic model of motor-carrier fuel optimization
- The Maximum Coverage Location Problem
- A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
- Optimal Location of Discretionary Service Facilities
- Regenerator Location Problem in Flexible Optical Networks
- Near-shortest and K-shortest simple paths
- Selected Topics in Column Generation
This page was built for publication: A branch and price approach for routing and refueling station location model
