The green vehicle routing problem with capacitated alternative fuel stations
References
Index Terms
- The green vehicle routing problem with capacitated alternative fuel stations
Recommendations
Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations
AbstractThe Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations aims to design minimum-cost routes for a fleet of electric vehicles subject to intra-route and inter-route ...
Highlights- This paper considers the routing of electric vehicles and their recharging en route.
Partial objective inequalities for the multi-item capacitated lot-sizing problem
We study the single-level multi-item capacitated lot-sizing problem (MCLSP).We propose partial objective inequalities to strengthen the MCLSP MIP formulation.These inequalities are strengthened by lifting and back-lifting strategies.A separation routine ...
A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem
We study a variant of the capacitated vehicle routing problem where the cost over each arc is defined as the product of the arc length and the weight of the vehicle when it traverses that arc. We propose two new mixed-integer linear programming ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Elsevier Science Ltd.
United Kingdom
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in