Mostrar el registro sencillo del ítem
dc.contributor.author | Corberán, A. | es_ES |
dc.contributor.author | Golden, Bruce | es_ES |
dc.contributor.author | Lum, Oliver | es_ES |
dc.contributor.author | PLANA, ISAAC | es_ES |
dc.contributor.author | Sanchís Llopis, José María | es_ES |
dc.date.accessioned | 2021-06-19T03:30:34Z | |
dc.date.available | 2021-06-19T03:30:34Z | |
dc.date.issued | 2017-10 | es_ES |
dc.identifier.issn | 0028-3045 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/168156 | |
dc.description.abstract | [EN] The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal of a proposed set of routes can have a strong influence on the willingness of a client to accept or reject a specific routing plan. While some work has analyzed algorithmic performance relative to traditional min-sum or min-max objective functions and aesthetic objective functions, we are not aware of any work that has considered a multi-objective approach. This work considers a multi-objective variant of the Min-Max K-Vehicles Windy Rural Postman Problem, discusses several formulations of the problem, and presents computational experiments with a heuristic algorithm. After exploring several formulations, we choose to study the problem with a bi-objective function that includes contributions from the route overlap index and average task distance aesthetic measures. The heuristic extends the cluster-first procedure presented in Lum et al. (Networks 69 (2017), 290-303) by incorporating the new objective function into the improvement phase and adding a perturbation routine. (c) 2017 Wiley Periodicals, Inc. | es_ES |
dc.description.sponsorship | Contract grant sponsor: Spanish Ministerio de Economia y Competitividad and Fondo Europeo de Desarrollo Regional (FEDER); Contract grant number: project MTM2015-68097-P (MINECO/FEDER). Contract grant sponsor: Generalitat Valenciana; Contract grant number: project GVPROMETEO2013-049 | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | John Wiley & Sons | es_ES |
dc.relation.ispartof | Networks | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Arc routing problems | es_ES |
dc.subject | Min-Max objective | es_ES |
dc.subject | Aesthetic objective | es_ES |
dc.subject | Multi-Objective problems | es_ES |
dc.subject.classification | MATEMATICA APLICADA | es_ES |
dc.title | Aesthetic considerations for the min-max K-Windy Rural Postman Problem | es_ES |
dc.type | Artículo | es_ES |
dc.type | Comunicación en congreso | es_ES |
dc.identifier.doi | 10.1002/net.21748 | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/GVA//PROMETEO%2F2013%2F049/ES/Modelos y algoritmos para problemas de optimización combinatoria/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/MINECO//MTM2015-68097-P-P/ES/MODELOS Y ALGORITMOS PARA PROBLEMAS DE RUTAS DE VEHICULOS Y DE LOCALIZACION DE SERVICIOS/ | es_ES |
dc.rights.accessRights | Cerrado | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada | es_ES |
dc.description.bibliographicCitation | Corberán, A.; Golden, B.; Lum, O.; Plana, I.; Sanchís Llopis, JM. (2017). Aesthetic considerations for the min-max K-Windy Rural Postman Problem. Networks. 70(3):216-232. https://doi.org/10.1002/net.21748 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.conferencename | 2nd Workshop on Arc Routing Problems (WARP2) | es_ES |
dc.relation.conferencedate | Mayo 22-24,2016 | es_ES |
dc.relation.conferenceplace | Lisboa, Portugal | es_ES |
dc.relation.publisherversion | https://doi.org/10.1002/net.21748 | es_ES |
dc.description.upvformatpinicio | 216 | es_ES |
dc.description.upvformatpfin | 232 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 70 | es_ES |
dc.description.issue | 3 | es_ES |
dc.relation.pasarela | S\368098 | es_ES |
dc.contributor.funder | Generalitat Valenciana | es_ES |
dc.contributor.funder | European Regional Development Fund | es_ES |
dc.contributor.funder | Ministerio de Economía y Competitividad | es_ES |
dc.description.references | Baños, R., Ortega, J., Gil, C., Márquez, A. L., & de Toro, F. (2013). A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. Computers & Industrial Engineering, 65(2), 286-296. doi:10.1016/j.cie.2013.01.007 | es_ES |
dc.description.references | Attea, B. A., Khalil, E. A., & Cosar, A. (2014). Multi-objective evolutionary routing protocol for efficient coverage in mobile sensor networks. Soft Computing, 19(10), 2983-2995. doi:10.1007/s00500-014-1462-y | es_ES |
dc.description.references | Benavent, E., Corberán, Á., Desaulniers, G., Lessard, F., Plana, I., & Sanchis, J. M. (2013). A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem. Networks, 63(1), 34-45. doi:10.1002/net.21520 | es_ES |
dc.description.references | Benavent, E., Corberán, A., Piñana, E., Plana, I., & Sanchis, J. M. (2005). New heuristic algorithms for the windy rural postman problem. Computers & Operations Research, 32(12), 3111-3128. doi:10.1016/j.cor.2004.04.007 | es_ES |
dc.description.references | Benavent, E., Corberán, A., Plana, I., & Sanchis, J. M. (2009). Min-Max K -vehicles windy rural postman problem. Networks, 54(4), 216-226. doi:10.1002/net.20334 | es_ES |
dc.description.references | Benavent, E., Corberán, A., Plana, I., & Sanchis, J. M. (2011). New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem. Networks, 58(4), 255-272. doi:10.1002/net.20469 | es_ES |
dc.description.references | Benavent, E., Corberán, Á., & Sanchis, J. M. (2009). A metaheuristic for the min–max windy rural postman problem with K vehicles. Computational Management Science, 7(3), 269-287. doi:10.1007/s10287-009-0119-2 | es_ES |
dc.description.references | Bode, C., & Irnich, S. (2012). Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem. Operations Research, 60(5), 1167-1182. doi:10.1287/opre.1120.1079 | es_ES |
dc.description.references | Bräysy, O., & Hasle, G. (2014). Chapter 12: Software Tools and Emerging Technologies for Vehicle Routing and Intermodal Transportation. Vehicle Routing, 351-380. doi:10.1137/1.9781611973594.ch12 | es_ES |
dc.description.references | Constantino, M., Gouveia, L., Mourão, M. C., & Nunes, A. C. (2015). The mixed capacitated arc routing problem with non-overlapping routes. European Journal of Operational Research, 244(2), 445-456. doi:10.1016/j.ejor.2015.01.042 | es_ES |
dc.description.references | Cordeau, J.-F. (2006). A Branch-and-Cut Algorithm for the Dial-a-Ride Problem. Operations Research, 54(3), 573-586. doi:10.1287/opre.1060.0283 | es_ES |
dc.description.references | Gulczynski, D., Golden, B., & Wasil, E. (2011). The period vehicle routing problem: New heuristics and real-world variants. Transportation Research Part E: Logistics and Transportation Review, 47(5), 648-668. doi:10.1016/j.tre.2011.02.002 | es_ES |
dc.description.references | He, R., Xu, W., Sun, J., & Zu, B. (2009). Balanced K-Means Algorithm for Partitioning Areas in Large-Scale Vehicle Routing Problem. 2009 Third International Symposium on Intelligent Information Technology Application. doi:10.1109/iita.2009.307 | es_ES |
dc.description.references | Janssens, J., Van den Bergh, J., Sörensen, K., & Cattrysse, D. (2015). Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning. European Journal of Operational Research, 242(1), 222-231. doi:10.1016/j.ejor.2014.09.026 | es_ES |
dc.description.references | G. Karypis V. Kumar METIS-unstructured graph partitioning and sparse matrix ordering system | es_ES |
dc.description.references | Karypis, G., & Kumar, V. (1998). A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing, 20(1), 359-392. doi:10.1137/s1064827595287997 | es_ES |
dc.description.references | Lu, Q., & Dessouky, M. M. (2006). A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. European Journal of Operational Research, 175(2), 672-687. doi:10.1016/j.ejor.2005.05.012 | es_ES |
dc.description.references | Lum, O., Cerrone, C., Golden, B., & Wasil, E. (2017). Partitioning a street network into compact, balanced, and visually appealing routes. Networks, 69(3), 290-303. doi:10.1002/net.21730 | es_ES |
dc.description.references | Magaia, N., Horta, N., Neves, R., Pereira, P. R., & Correia, M. (2015). A multi-objective routing algorithm for Wireless Multimedia Sensor Networks. Applied Soft Computing, 30, 104-112. doi:10.1016/j.asoc.2015.01.052 | es_ES |
dc.description.references | Mandal, S. K., Pacciarelli, D., Løkketangen, A., & Hasle, G. (2015). A memetic NSGA-II for the bi-objective mixed capacitated general routing problem. Journal of Heuristics, 21(3), 359-390. doi:10.1007/s10732-015-9280-7 | es_ES |
dc.description.references | Matis, P. (2008). DECISION SUPPORT SYSTEM FOR SOLVING THE STREET ROUTING PROBLEM. TRANSPORT, 23(3), 230-235. doi:10.3846/1648-4142.2008.23.230-235 | es_ES |
dc.description.references | Melián-Batista, B., De Santiago, A., AngelBello, F., & Alvarez, A. (2014). A bi-objective vehicle routing problem with time windows: A real case in Tenerife. Applied Soft Computing, 17, 140-152. doi:10.1016/j.asoc.2013.12.012 | es_ES |
dc.description.references | Ombuki, B., Ross, B. J., & Hanshar, F. (2006). Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows. Applied Intelligence, 24(1), 17-30. doi:10.1007/s10489-006-6926-z | es_ES |
dc.description.references | Poot, A., Kant, G., & Wagelmans, A. P. M. (2002). A savings based method for real-life vehicle routing problems. Journal of the Operational Research Society, 53(1), 57-68. doi:10.1057/palgrave/jors/2601252 | es_ES |