Author:
Mirzaei Shokoufeh,Krishnan Krishna,Yildrim Bayram
Abstract
Sustainability and energy savings have attracted considerable attention in recent years. However, in the traditional location-routing problem (LRP), the objective function has yet to minimize the distance traveled regardless of the amount of energy consumed. Although, distance is one of the major factors determining the energy consumption of a distribution network, it is not the only factor. Therefore, this paper explains the development of a novel formulation of the LRP that considers energy minimization, which is called the energy-efficient location-routing problem (EELRP). The energy consumed by a vehicle to travel between two nodes in a system depends on many forces. Among those, rolling resistance (RR) and aerodynamic drag are considered in this paper to be the major contributing forces. The presented mixed-integer non-linear program (MINLP) finds the best location-allocation routing plan with the objective function of minimizing total costs, including energy, emissions, and depot establishment. The proposed model can also handle the vehicle-selection problem with respect to a vehicles’ capacity, source of energy, and aerodynamic characteristics. The formulation proposed can also solve the problems with hard and soft time window constraints. Also, the model is enhanced to handle the EELRP with dynamic customers’ demands. Some examples are presented to illustrate the formulations presented in this paper.
Publisher
Society for Industrial and Systems Engineering
Subject
Applied Mathematics,General Mathematics
Reference33 articles.
1. Artmeier, A., Haselmayr, J., Leucker, M., and Sachenbacher, M. (2010a). The optimal routing problem in the context of battery-powered electric vehicles, Workshop: CROCS at CPAIOR-10, Second International Workshop on Constraint Reasoning and Optimization for Computational Sustainability, Bologna, Italy, 2010.
2. Artmeier, A., Haselmayr, J., Leucker, M., and Sachenbacher, M. (2010b). The shortest path problem revisited: Optimal routing for electric vehicles. KI 2010: Advances in Artificial Intelligence, 309-316.
3. Bard, J., Kontoravdis, G., and Yu, G. (2002). A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science, 36(2), 250.
4. Braysy, O. and Gendreau, M. (2005a). Vehicle routing problem with time windows. Part I: Route construction and local search algorithms. Transportation Science, 39(1), 104-118.
5. Braysy, O. and Gendreau, M. (2005b). Vehicle routing problem with time windows. Part II: Metaheuristics. Transportation Science, 39(1), 119-139.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献