- -

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

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

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

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: 5916-29113-1-PB.pdf
Tamaño: 619.2Kb
Formato: PDF
Abrir
dc.contributor.author Yousefikhoshbakht, Majid es_ES
dc.contributor.author Dolatnejad, Azam es_ES
dc.date.accessioned 2017-10-25T06:59:51Z
dc.date.available 2017-10-25T06:59:51Z
dc.date.issued 2017-07-28
dc.identifier.issn 2340-5317
dc.identifier.uri http://hdl.handle.net/10251/89979
dc.description.abstract [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. es_ES
dc.language Inglés es_ES
dc.publisher Universitat Politècnica de València
dc.relation.ispartof International Journal of Production Management and Engineering
dc.rights Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) es_ES
dc.subject Open Vehicle Routing Problem es_ES
dc.subject Heterogeneous Fixed Fleet es_ES
dc.subject NP-hard Problems es_ES
dc.subject Column Generation es_ES
dc.title A Column Generation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem es_ES
dc.type Artículo es_ES
dc.date.updated 2017-10-25T06:53:33Z
dc.identifier.doi 10.4995/ijpme.2017.5916
dc.rights.accessRights Abierto es_ES
dc.description.bibliographicCitation 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. https://doi.org/10.4995/ijpme.2017.5916 es_ES
dc.description.accrualMethod SWORD es_ES
dc.relation.publisherversion https://doi.org/10.4995/ijpme.2017.5916 es_ES
dc.description.upvformatpinicio 55 es_ES
dc.description.upvformatpfin 71 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 5
dc.description.issue 2
dc.identifier.eissn 2340-4876
dc.description.references Aleman, 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.033123 es_ES
dc.description.references Anbuudayasankar, 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.009 es_ES
dc.description.references Brandã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 es_ES
dc.description.references Ç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.045 es_ES
dc.description.references Dantzig, G. B., & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science, 6(1), 80-91. doi:10.1287/mnsc.6.1.80 es_ES
dc.description.references Gendreau, 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.002 es_ES
dc.description.references Gendreau, 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-2 es_ES
dc.description.references Lei, 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.007 es_ES
dc.description.references Li, 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.025 es_ES
dc.description.references Li, 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.004 es_ES
dc.description.references Penna, 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-y es_ES
dc.description.references Saadati Eskandari, Z., YousefiKhoshbakht, M. (2012). Solving the Vehicle Routing Problem by an Effective Reactive Bone Route Algorithm, Transportation Research Journal, 1(2), 51-69. es_ES
dc.description.references 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.011 es_ES
dc.description.references Syslo, 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:1999101 es_ES
dc.description.references Tarantilis, 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.059 es_ES
dc.description.references Wang, 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.018 es_ES
dc.description.references Yousefikhoshbakht, 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.855337 es_ES
dc.description.references Yousefikhoshbakht, 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-11 es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem