Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Hipólito Hernández-Pérez"'
Publikováno v:
European Journal of Operational Research. 297:467-483
This paper deals with the problem of designing a minimum-cost route for a capacitated vehicle moving a commodity between a set of customers, allowing two features uncommon in the pickup-and-delivery literature. One feature is that a customer accepts
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93b5f1434e934df4225795f2f00feed0
https://doi.org/10.1016/j.ejor.2021.05.040
https://doi.org/10.1016/j.ejor.2021.05.040
Publikováno v:
Computers & Operations Research. 97:1-17
This article addresses the problem of designing routes of minimum cost for a capacitated vehicle moving a commodity between a set of customers, allowing two characteristics uncommon in the pickup-and-delivery literature. One characteristic is that a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15727cb9a96c5a482b2c4d8b5190a934
https://doi.org/10.1016/j.cor.2018.04.016
https://doi.org/10.1016/j.cor.2018.04.016
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030311391
ICCL
ICCL
This paper describes a branch-and-cut algorithm for a generalization of the Capacitated Vehicle Routing Problem where a customer can be visited several times. The algorithm is based on solving a Mixed Integer Programming model for a relaxed problem,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6704e23f7bcd51977cac32b7fabd3c4a
https://doi.org/10.1007/978-3-030-31140-7_12
https://doi.org/10.1007/978-3-030-31140-7_12
Publikováno v:
Computers & Operations Research. 127:105152
We present in this paper a generalization of the one-commodity pickup and delivery traveling salesman problem where each customer supplies or demands a given amount of a certain product. The objective is to design a minimum cost two-echelon transport
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f5c7ebe6532491a10511f895a8ab5a7
https://doi.org/10.1016/j.cor.2020.105152
https://doi.org/10.1016/j.cor.2020.105152
Publikováno v:
European Journal of Operational Research. 251:44-52
We address in this article the multi-commodity pickup-and-delivery traveling salesman problem, which is a routing problem for a capacitated vehicle that has to serve a set of customers that provide or require certain amounts of m different products.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1eee8e063bd2f39b004be15e06a12f7
https://doi.org/10.1016/j.ejor.2015.10.053
https://doi.org/10.1016/j.ejor.2015.10.053
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319961507
ISCO
ISCO
This paper concerns the problem of designing a route of minimum cost for a capacitated vehicle moving a single commodity between a set of customers. The route must allow two characteristics uncommon in the literature. One characteristic is that a cus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38e7fe6bb8ff3d6257e2133f527912a7
https://doi.org/10.1007/978-3-319-96151-4_21
https://doi.org/10.1007/978-3-319-96151-4_21
Publikováno v:
Networks. 63:46-59
The "multi-commodity Pickup-and-Delivery Traveling Salesman Problem" m-PDTSP is a generalization of the well-known "Traveling Salesman Problem" in which cities correspond to customers providing or requiring known amounts of m different products, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::091388e7712ffe473cf5185be56a3b54
https://doi.org/10.1002/net.21521
https://doi.org/10.1002/net.21521
Publikováno v:
Computers & Operations Research. 36:1639-1645
We address in this paper the one-commodity pickup-and-delivery traveling salesman problem, which is characterized by a set of customers, each of them supplying (pickup customer) or demanding (delivery customer) a given amount of a single product. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fccd14b5092619c4884e1001648805f7
https://doi.org/10.1016/j.cor.2008.03.008
https://doi.org/10.1016/j.cor.2008.03.008
Publikováno v:
Networks. 50:258-272
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36e472933af53907edaf8ccf911f9b62
https://doi.org/10.1002/net.20209
https://doi.org/10.1002/net.20209
Autor:
Hipólito Hernández-Pérez, Juan-José Salazar-González, Jorge Riera-Ledesma, Inmaculada Rodríguez-Martín
Publikováno v:
Electronic Notes in Discrete Mathematics. 41:1-3
International Network Optimization Conference (INOC) is the biennial meeting of the EURO working group on Network Optimization (ENOG). The last edition of this conference (INOC 2013) was held in Costa Adeje (Tenerife, Spain), May 20–22, 2013. This
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f810157fbd8c6cbb97b7f08380af71bc
https://doi.org/10.1016/j.endm.2013.05.068
https://doi.org/10.1016/j.endm.2013.05.068