A Column Generation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem

[EN] This paper addressed the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), in which the vehicles are not required to return to the depot after completing a service. In this new problem, the demands of customers are fulfilled by a heterogeneous fixed fleet of vehicles having various capacities, fixed costs and variable costs. This problem is an important variant of the open vehicle routing problem (OVRP) and can cover more practical situations in transportation and logistics. Since this problem belongs to NP-hard Problems, An approach based on column generation (CG) is applied to solve the HFFOVRP. A tight integer programming model is presented and the linear programming relaxation of which is solved by the CG technique. Since there have been no existing benchmarks, this study generated 19 test problems and the results of the proposed CG algorithm is compared to the results of exact algorithm. Computational experience confirms that the proposed algorithm can provide better solutions within a comparatively shorter period of time.Yousefikhoshbakht, M.; Dolatnejad, A. (2017). A Column Generation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem. International Journal of Production Management and Engineering. 5(2):55-71. doi:10.4995/ijpme.2017.5916SWORD557152Aleman, R. E., & Hill, R. R. (2010). A tabu search with vocabulary building approach for the vehicle routing problem with split demands. International Journal of Metaheuristics, 1(1), 55. doi:10.1504/ijmheur.2010.033123Anbuudayasankar, S. P., Ganesh, K., Lenny Koh, S. C., & Ducq, Y. (2012). Modified savings heuristics and genetic algorithm for bi-objective vehicle routing problem with forced backhauls. Expert Systems with Applications, 39(3), 2296-2305. doi:10.1016/j.eswa.2011.08.009Brandão, J. (2009). A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research, 195(3), 716-728. doi:10.1016/j.ejor.2007.05.059Çatay, B. (2010). A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. Expert Systems with Applications, 37(10), 6809-6817. doi:10.1016/j.eswa.2010.03.045Dantzig, G. B., & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science, 6(1), 80-91. doi:10.1287/mnsc.6.1.80Gendreau, M., Guertin, F., Potvin, J.-Y., & Séguin, R. (2006). Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C: Emerging Technologies, 14(3), 157-174. doi:10.1016/j.trc.2006.03.002Gendreau, M., Laporte, G., Musaraganyi, C., & Taillard, É. D. (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 26(12), 1153-1173. doi:10.1016/s0305-0548(98)00100-2Lei, H., Laporte, G., & Guo, B. (2011). The capacitated vehicle routing problem with stochastic demands and time windows. Computers & Operations Research, 38(12), 1775-1783. doi:10.1016/j.cor.2011.02.007Li, X., Leung, S. C. H., & Tian, P. (2012). A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Systems with Applications, 39(1), 365-374. doi:10.1016/j.eswa.2011.07.025Li, X., Tian, P., & Aneja, Y. P. (2010). An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review, 46(6), 1111-1127. doi:10.1016/j.tre.2010.02.004Penna, P. H. V., Subramanian, A., & Ochi, L. S. (2011). An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem. Journal of Heuristics, 19(2), 201-232. doi:10.1007/s10732-011-9186-ySaadati Eskandari, Z., YousefiKhoshbakht, M. (2012). Solving the Vehicle Routing Problem by an Effective Reactive Bone Route Algorithm, Transportation Research Journal, 1(2), 51-69.Subramanian, A., Drummond, L. M. A., Bentes, C., Ochi, L. S., & Farias, R. (2010). A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. Computers & Operations Research, 37(11), 1899-1911. doi:10.1016/j.cor.2009.10.011Syslo, M., Deo, N., Kowalik, J. (1983). Discrete Optimization Algorithms with Pascal Programs, Prentice Hall.Taillard, E. D. (1999). A heuristic column generation method for the heterogeneous fleet VRP, RAIRO Operations Research, 33, 1-14. https://doi.org/10.1051/ro:1999101Tarantilis, C. D., & Kiranoudis, C. T. (2007). A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector. European Journal of Operational Research, 179(3), 806-822. doi:10.1016/j.ejor.2005.03.059Wang, H.-F., & Chen, Y.-Y. (2012). A genetic algorithm for the simultaneous delivery and pickup problems with time window. Computers & Industrial Engineering, 62(1), 84-95. doi:10.1016/j.cie.2011.08.018Yousefikhoshbakht, M., Didehvar, F., & Rahmati, F. (2013). Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm. International Journal of Production Research, 52(9), 2565-2575. doi:10.1080/00207543.2013.855337Yousefikhoshbakht, M., & Khorram, E. (2012). Solving the vehicle routing problem by a hybrid meta-heuristic algorithm. Journal of Industrial Engineering International, 8(1). doi:10.1186/2251-712x-8-1

On green routing and scheduling problem

The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools

Dynamic approach to solve the daily drayage problem with travel time uncertainty

The intermodal transport chain can become more e cient by means of a good organization of drayage movements. Drayage in intermodal container terminals involves the pick up and delivery of containers at customer locations, and the main objective is normally the assignment of transportation tasks to the di erent vehicles, often with the presence of time windows. This scheduling has traditionally been done once a day and, under these conditions, any unexpected event could cause timetable delays. We propose to use the real-time knowledge about vehicle position to solve this problem, which permanently allows the planner to reassign tasks in case the problem conditions change. This exact knowledge of the position of the vehicles is possible using a geographic positioning system by satellite (GPS, Galileo, Glonass), and the results show that this additional data can be used to dynamically improve the solution

Tackling Dynamic Vehicle Routing Problem with Time Windows by means of Ant Colony System

The Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) is an extension of the well-known Vehicle Routing Problem (VRP), which takes into account the dynamic nature of the problem. This aspect requires the vehicle routes to be updated in an ongoing manner as new customer requests arrive in the system and must be incorporated into an evolving schedule during the working day. Besides the vehicle capacity constraint involved in the classical VRP, DVRPTW considers in addition time windows, which are able to better capture real-world situations. Despite this, so far, few studies have focused on tackling this problem of greater practical importance. To this end, this study devises for the resolution of DVRPTW, an ant colony optimization based algorithm, which resorts to a joint solution construction mechanism, able to construct in parallel the vehicle routes. This method is coupled with a local search procedure, aimed to further improve the solutions built by ants, and with an insertion heuristics, which tries to reduce the number of vehicles used to service the available customers. The experiments indicate that the proposed algorithm is competitive and effective, and on DVRPTW instances with a higher dynamicity level, it is able to yield better results compared to existing ant-based approaches.Comment: 10 pages, 2 figure

On the use of biased-randomized algorithms for solving non-smooth optimization problems

Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory management, it is possible to consider stock-outs generated by unexpected demands; and in manufacturing processes and project management, it is frequent that some deadlines cannot be met due to delays in critical steps of the supply chain. However, capacity-, size-, and time-related limitations are included in many optimization problems as hard constraints, while it would be usually more realistic to consider them as soft ones, i.e., they can be violated to some extent by incurring a penalty cost. Most of the times, this penalty cost will be nonlinear and even noncontinuous, which might transform the objective function into a non-smooth one. Despite its many practical applications, non-smooth optimization problems are quite challenging, especially when the underlying optimization problem is NP-hard in nature. In this paper, we propose the use of biased-randomized algorithms as an effective methodology to cope with NP-hard and non-smooth optimization problems in many practical applications. Biased-randomized algorithms extend constructive heuristics by introducing a nonuniform randomization pattern into them. Hence, they can be used to explore promising areas of the solution space without the limitations of gradient-based approaches, which assume the existence of smooth objective functions. Moreover, biased-randomized algorithms can be easily parallelized, thus employing short computing times while exploring a large number of promising regions. This paper discusses these concepts in detail, reviews existing work in different application areas, and highlights current trends and open research lines