A branch and price approach for routing and refueling station location model
From MaRDI portal
Publication:320784
DOI10.1016/J.EJOR.2015.05.021zbMATH Open1346.90525OpenAlexW339885383MaRDI QIDQ320784FDOQ320784
Barış Yıldız, Oya Ekin Karasan, 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
Recommendations
- Capacitated refueling station location problem with traffic deviations over multiple time periods
- Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
- A heuristic algorithm for optimal location of flow-refueling capacitated stations
- Locating alternative-fuel refueling stations on a multi-class vehicle transportation network
- Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
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)
Cites Work
- Selected Topics in Column Generation
- Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
- The Maximum Coverage Location Problem
- A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
- Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
- Optimal Location of Discretionary Service Facilities
- 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
- To Fill or Not to Fill: The Gas Station Problem
- A generic model of motor-carrier fuel optimization
- Regenerator Location Problem in Flexible Optical Networks
- Near-shortest and K-shortest simple paths
Cited In (24)
- Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
- Exact Approaches for Network Design Problems with Relays
- Primal dual algorithms for the vehicle refueling problem
- A multi-stage stochastic integer programming approach for locating electric vehicle charging stations
- 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
- A Benders decomposition algorithm for the maximum availability service facility location problem
- An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations
- An efficient heuristic algorithm for the alternative-fuel station location problem
- The electric location routing problem with time windows and partial recharging
- Regenerator Location Problem in Flexible Optical Networks
- Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty
- Branch-and-price approaches for the network design problem with relays
- Locomotive fuel management with inline refueling
- Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel
- A branch\&cut approach to recharging and refueling infrastructure planning
- The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach
- A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system
- A learning based algorithm for drone routing
- Efficient and equitable transnational infrastructure planning for natural gas trucking in the European union
- Exact Solution of the Evasive Flow Capturing Problem
- Locational analysis of in-motion wireless power transfer system for long-distance trips by electric vehicles: optimal locations and economic rationality in Japanese expressway network
- An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network
- The location routing problem using electric vehicles with constrained distance
This page was built for publication: A branch and price approach for routing and refueling station location model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320784)
