首页 | 本学科首页   官方微博 | 高级检索  
     


A goal programming approach to vehicle routing problems with soft time windows
Authors:Herminia I. Calvete,Carmen Galé  ,Marí  a-José   Oliveros,Belé  n Sá  nchez-Valverde
Affiliation:1. Dpto. de Métodos Estadísticos, Universidad de Zaragoza, Pedro Cerbuna 12, 50009 Zaragoza, Spain;2. Dpto. de Métodos Estadísticos, Universidad de Zaragoza, María de Luna 3, 50018 Zaragoza, Spain;3. Dpto. de Ingeniería de Diseño y Fabricación, Universidad de Zaragoza, María de Luna 3, 50018 Zaragoza, Spain
Abstract:The classical vehicle routing problem involves designing a set of routes for a fleet of vehicles based at one central depot that is required to serve a number of geographically dispersed customers, while minimizing the total travel distance or the total distribution cost. Each route originates and terminates at the central depot and customers demands are known. In many practical distribution problems, besides a hard time window associated with each customer, defining a time interval in which the customer should be served, managers establish multiple objectives to be considered, like avoiding underutilization of labor and vehicle capacity, while meeting the preferences of customers regarding the time of the day in which they would like to be served (soft time windows). This work investigates the use of goal programming to model these problems. To solve the model, an enumeration-followed-by-optimization approach is proposed which first computes feasible routes and then selects the set of best ones. Computational results show that this approach is adequate for medium-sized delivery problems.
Keywords:Vehicle routing   Logistics   Time windows   Goal programming   Enumeration
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号