Filters








1,513 Hits in 6.0 sec

The multi-depot split-delivery vehicle routing problem: Model and solution algorithm

Sujoy Ray, Andrei Soeanu, Jean Berger, Mourad Debbabi
<span title="">2014</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/w5jcgie76rehrmy3uf2hriydla" style="color: black;">Knowledge-Based Systems</a> </i> &nbsp;
First, we elaborate a new integer linear programming (ILP) model, namely: Multi-Depot Split-Delivery Vehicle Routing Problem (MDSDVRP) which allows establishing depot locations and routes for serving customer  ...  In this paper, we investigate a centralized model and a heuristic algorithm for solving the multi-depot logistics delivery problem including depot selection and shared commodity delivery.  ...  The specific focus of this study is the multi-depot split-delivery and location routing problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.knosys.2014.08.006">doi:10.1016/j.knosys.2014.08.006</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qdclxjq5ong7roulvmw5huw6w4">fatcat:qdclxjq5ong7roulvmw5huw6w4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829124313/http://cradpdf.drdc-rddc.gc.ca/PDFS/unc171/p801217_A1b.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/aa/50/aa5044421df1db9a72ab8bc4e70a0931916b8cda.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.knosys.2014.08.006"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A Rich Vehicle Routing Problem for a City Logistics Problem

Daniela Ambrosino, Carmine Cerrone
<span title="2022-01-08">2022</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ye33srllvnanjouxn4tmrfgjsq" style="color: black;">Mathematics</a> </i> &nbsp;
Thus, we deal with a multi-period vehicle routing problem with a heterogeneous fleet of vehicles, with customers' requirements and company restrictions to satisfy, in which the fleet composition has to  ...  Tests have been used for evaluating the quality of the solutions in terms of both model behavior and service level to grant to the customers.  ...  The authors analyze a multi-depot network, where it is also possible to use auxiliary depots for improving routing costs and permitting to anticipate deliveries; moreover, incompatibilities between customers  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/math10020191">doi:10.3390/math10020191</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x3ohhfom4bh6djatekd3hio2am">fatcat:x3ohhfom4bh6djatekd3hio2am</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220113121947/https://mdpi-res.com/d_attachment/mathematics/mathematics-10-00191/article_deploy/mathematics-10-00191.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/db/14/db1495f04527d62d24ebcc79bc19a5dd1c175cb6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/math10020191"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Five years of multi-depot vehicle routing problems

Nuwan Jayarathna, Jayantha Lanel, Z.A.M.S. Juman
<span title="2020-11-16">2020</span> <i title="Centre of Sociological Research, NGO"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qjcijp35dvalrk3h2nlje4udre" style="color: black;">Journal of Sustainable Development of Transport and Logistics</a> </i> &nbsp;
However, a more realistic version of the classical VRP, where the distribution of goods is done from several depots is the Multi-Depot Vehicle Routing Problem (MDVRP), which has been the central attraction  ...  The objective of this problem is to find the routes for vehicles to serve all the customers at a minimal cost in terms of the number of routes and the total distance travelled without violating the capacity  ...  Introduction to Multi-Depot Vehicle Routing Problems The Multi-Depot Vehicle Routing Problem (MDVRP) (Pardalos & Coleman, 2009 ) is a generalization of the Single-Depot Vehicle Routing Problem (SDVRP)  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14254/jsdtl.2020.5-2.10">doi:10.14254/jsdtl.2020.5-2.10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/57aipolrqzax3dlomhu2ssz7tm">fatcat:57aipolrqzax3dlomhu2ssz7tm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201129201528/https://jsdtl.sciview.net/index.php/jsdtl/article/download/117/83" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/75/92/75922f5c2b9ba84e607cf19b254216dcfe6ac70f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14254/jsdtl.2020.5-2.10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Multi-Depot Split-Delivery Vehicle Routing Problem

Hyunpae Lim, Gyu M. Lee, Ivan Kristianto Singgih
<span title="">2021</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q7qi7j4ckfac7ehf3mjbso4hne" style="color: black;">IEEE Access</a> </i> &nbsp;
INDEX TERMS Vehicle routing problem (VRP), multi-depot split-delivery VRP, genetic algorithm (GA), taguchi method.  ...  This study proposed the mixed-integer programming (MIP) model for the multi-depot split-delivery vehicle routing problems (MDSDVRPs) with hetero vehicles, allowing multiple visits to a customer.  ...  PROBLEM DESCRIPTION AND MATHEMATICAL MODEL This section presents a MIP model for the MDSDVRP with heterogeneous vehicles from multiple depots, allowing split deliveries.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2021.3103640">doi:10.1109/access.2021.3103640</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vys7vvmg3va53i43zjuwzsemgi">fatcat:vys7vvmg3va53i43zjuwzsemgi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210820085344/https://ieeexplore.ieee.org/ielx7/6287639/9312710/09509411.pdf?tp=&amp;arnumber=9509411&amp;isnumber=9312710&amp;ref=" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0f/e9/0fe95ae4bdeeca4ebb0560f0b73ba5f04c6ad3d7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2021.3103640"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> ieee.com </button> </a>

A survey on pickup and delivery problems

Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl
<span title="2008-03-13">2008</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4sdnxwsvnvdnno4e2ycjb6wfgq" style="color: black;">Journal für Betriebswirtschaft</a> </i> &nbsp;
Single as well as multi vehicle versions of the mathematical problem formulations are given for all four VRPB types, the corresponding exact, heuristic, and metaheuristic solution methods are discussed  ...  These are the Pickup and Delivery Vehicle Routing Problem (PDVRP -unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP -paired pickup and delivery points), and the Dial-A-Ride  ...  We thank the researchers working in the field of transportation logistics for their various contributions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11301-008-0033-7">doi:10.1007/s11301-008-0033-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oqvjk26ukva63gxo7kctdgsvpe">fatcat:oqvjk26ukva63gxo7kctdgsvpe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809015110/http://prolog.univie.ac.at/research/surveyPDP/PDPsurveyPart1_web.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8e/f6/8ef661ae796001fc36fdd6f2a6ef8ec7052afcf1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11301-008-0033-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Study on Bio-Inspired Metaheuristics for Solving Vehicle Routing Problem

R. Yesodha, T. Amudha
<span title="2015-10-26">2015</span> <i title="Indian Society for Education and Environment"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wffwpj3q45g5zfjzfeyagk5uea" style="color: black;">Indian Journal of Science and Technology</a> </i> &nbsp;
A scatter search algorithm for the split delivery vehicle routing problem.  ...  Modeling and solving the capacitated vehicle routing problem on trees.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.17485/ijst/2015/v8i25/80042">doi:10.17485/ijst/2015/v8i25/80042</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4iadtd4kenh57dfdkqtk5ido5e">fatcat:4iadtd4kenh57dfdkqtk5ido5e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720122350/http://www.indjst.org/index.php/indjst/article/download/80042/61977" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.17485/ijst/2015/v8i25/80042"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Ant Colony Optimization For Split Delivery Inventory Routing Problem

Lily Wong, Noor Hasnah Moin
<span title="2017-12-15">2017</span> <i title="Univ. of Malaya"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xcqic3sozzcvncfs2um5qebque" style="color: black;">Malaysian Journal of Computer Science</a> </i> &nbsp;
The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (the best integer solution) for each problem considered.  ...  We allow the customers to be visited more than once in a given period (split delivery) and the demand for each product is deterministic and time varying. Backordering is not allowed.  ...  We note that both ACO and ACO2 are more likely to give savings in term of transportation costs instead of inventory costs even though we did embedded the inventory cost component in the global pheromones  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22452/mjcs.vol30no4.5">doi:10.22452/mjcs.vol30no4.5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ybixg7lzbvfhddpzyf56fyr2xe">fatcat:ybixg7lzbvfhddpzyf56fyr2xe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721111122/https://ejournal.um.edu.my/index.php/MJCS/article/download/9900/6991" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/52/b8/52b87d41295ccca4bde30fdc0ed35e1ee64f704b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22452/mjcs.vol30no4.5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order

Yangkun Xia, Zhuo Fu, Lijun Pan, Fenghua Duan, Xiaolei Ma
<span title="2018-05-15">2018</span> <i title="Public Library of Science (PLoS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s3gm7274mfe6fcs7e3jterqlri" style="color: black;">PLoS ONE</a> </i> &nbsp;
The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution.  ...  This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP.  ...  In addition, in the further study, we can consider adding more constraints into the DCVRPSDO, such as the multi-depots, multi-type vehicles, time windows, deliveries and pickups, dynamic vehicle routing  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1371/journal.pone.0195457">doi:10.1371/journal.pone.0195457</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/29763419">pmid:29763419</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC5953470/">pmcid:PMC5953470</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ralprpktz5f2jjs62hjvgtr7am">fatcat:ralprpktz5f2jjs62hjvgtr7am</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723044604/http://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0195457&amp;type=printable" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2e/cc/2ecca0abec03c4c04d9099a3ec4a56e9f15ee20f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1371/journal.pone.0195457"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> plos.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5953470" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

A survey on pickup and delivery problems

Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl
<span title="2008-05-16">2008</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4sdnxwsvnvdnno4e2ycjb6wfgq" style="color: black;">Journal für Betriebswirtschaft</a> </i> &nbsp;
These are the Pickup and Delivery Vehicle Routing Problem (PDVRP -unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP -paired pickup and delivery points), and the Dial-A-Ride  ...  Single as well as multi vehicle mathematical problem formulations for all three VRPPD types are given, and the respective exact, heuristic, and metaheuristic solution methods are discussed.  ...  We thank the researchers working in the field of transportation logistics for their various contributions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11301-008-0036-4">doi:10.1007/s11301-008-0036-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wv5idhicxvdvvmntj36f5mnpqq">fatcat:wv5idhicxvdvvmntj36f5mnpqq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812013537/http://prolog.univie.ac.at/research/surveyPDP/PDPsurveyPart2_web.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/21/d9/21d93bf267d38bdc175fc6dba15aa27f16bf1e71.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11301-008-0036-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A new hybrid algorithm for multi-depot vehicle routing problem with time windows and split delivery

U.S.S. Dharmapriya, S.B. Siyambalapitiya, A.K. Kulatunga
<span title="">2012</span> <i title="Inderscience Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rwwf452535fwzge4hsbs4xb2tm" style="color: black;">International Journal of Industrial and Systems Engineering</a> </i> &nbsp;
In this research, hybrid algorithm (SATS) is developed based on Simulated Annealing (SA) and Tabu Search (TS) techniques to improve the solution quality of the complex Multi Depot Vehicle Routing Problem  ...  with Time Windows and Split Delivery (MDVRPTWSD).  ...  William (2008) addressed Multi depot vehicle routing problem and introduced a hybrid genetic algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1504/ijise.2012.046658">doi:10.1504/ijise.2012.046658</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kyc3hevyxrckbaaxipsc4l7gym">fatcat:kyc3hevyxrckbaaxipsc4l7gym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830042106/http://www.iieom.org/paper/193%20Subodha.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b2/24/b224a507330b638a8aaf36ce1192e49a5ab646eb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1504/ijise.2012.046658"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Vehicle routing problems with multiple trips

Diego Cattaruzza, Nabil Absi, Dominique Feillet
<span title="2016-01-27">2016</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/a7azxtgamnavvcktn5y7xrjas4" style="color: black;">4OR</a> </i> &nbsp;
This paper presents a survey on the Multi-Trip Vehicle Routing Problem (MTVRP) and on related routing problems where vehicles are allowed to perform multiple trips.  ...  For the latter, it specially insists on the motivations for having multiple trips and the algorithmic consequences.  ...  The Multi-Trip Vehicle Routing Problem As explained above, the Multi-Trip Vehicle Routing Problem was introduced in different papers, under different names and sometimes with some slight differences in  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10288-016-0306-2">doi:10.1007/s10288-016-0306-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/w7gomsxn7bcknbdxa4ogfmqv5m">fatcat:w7gomsxn7bcknbdxa4ogfmqv5m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190221022658/http://pdfs.semanticscholar.org/31fc/f1655ccf2af92c34bf8858e6b6bcf872a3dd.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/31/fc/31fcf1655ccf2af92c34bf8858e6b6bcf872a3dd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10288-016-0306-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Multi-Objective Solution of Green Vehicle Routing Problem

Özgür Kabadurmuş, Mehmet Serdar Erdoğan, Yiğitcan Özkan, Mertcan Köseoğlu
<span title="2019-06-01">2019</span> <i title="Walter de Gruyter GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ow5qtln7wfhina32xlpgejvu54" style="color: black;">Logistics &amp; Sustainable Transport</a> </i> &nbsp;
In this study, we formulated a multi-objective optimization model of Green Vehicle Routing Problem with two conflicting objective functions.  ...  To solve this multi-objective problem, we used ɛ-constraint method, a multi-objective optimization technique, and found the Pareto optimal solutions.  ...  Furthermore, [24] developed an HVRP with time windows and split deliveries. They proposed a Scatter-Search (SS) approach to solving the model. Jair et al.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2478/jlst-2019-0003">doi:10.2478/jlst-2019-0003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ayow5b2e2nh63fw5vqcdxxhqny">fatcat:ayow5b2e2nh63fw5vqcdxxhqny</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200613144414/https://content.sciendo.com/downloadpdf/journals/jlst/10/1/article-p31.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/dc/38/dc384c7bdd07c192e1b7cdc59013ebf3d87897ea.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2478/jlst-2019-0003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Capacitated vehicle routing problem model for carriers

Irma-Delia Rojas-Cuevas, Santiago-Omar Caballero-Morales, Jose-Luis Martinez-Flores, Jose-Rafael Mendoza-Vazquez
<span title="2018-07-02">2018</span> <i title="AOSIS"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ppo5k3vuhjaptiqksioivj6oo4" style="color: black;">Journal of Transport and Supply Chain Management</a> </i> &nbsp;
The Capacitated Vehicle Routing Problem (CVRP) is one of the most important transportation problems in logistics and supply chain management.  ...  Problem for Carriers (CVRPfC) model is used to consider the distribution scenario where a fleet of vehicles depart from a vehicle storage depot, collect products from a set of customer points and deliver  ...  The main author would also like to thank Tecnológico Nacional de México/Instituto Tecnológico de Puebla and Consejo Nacional de Ciencia y Tecnología (CONACYT) for their support and the scholarship to pursue  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4102/jtscm.v12i0.345">doi:10.4102/jtscm.v12i0.345</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/33tclmy6x5c6rajjcumytmjztm">fatcat:33tclmy6x5c6rajjcumytmjztm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190429074921/https://jtscm.co.za/index.php/jtscm/article/download/345/680" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4102/jtscm.v12i0.345"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A new memetic algorithm for solving split delivery vehicle routing problem

Ali Bozorgi-Amiri, Vahid Mahmoodian, Elham Fahimnia, Hamid Saffari
<span title="">2015</span> <i title="Growing Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o7iwq357drbcdjp5obca6bonve" style="color: black;">Management Science Letters</a> </i> &nbsp;
Split delivery vehicle routing problem is one of the traditional types of routing problems in which the demand of different points can be divided among vehicles and the objective is to minimize the path  ...  The performance of the proposed algorithm for 21 standard problems is compared with the optimum solutions obtained from mathematical programming standard solver and the solutions of the same algorithm  ...  Acknowledgement The authors would like to thank the anonymous referees for constructive comments on earlier version of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5267/j.msl.2015.8.010">doi:10.5267/j.msl.2015.8.010</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pfjejr4pe5em3md67fldkaqt4q">fatcat:pfjejr4pe5em3md67fldkaqt4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180602063944/http://www.growingscience.com/msl/Vol5/msl_2015_94.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f6/c9/f6c9e05402eb180a7bd9f84a227fc564d2ba93a8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5267/j.msl.2015.8.010"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Inventory routing problems with multiple customers

Luca Bertazzi, M. Grazia Speranza
<span title="2013-05-07">2013</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ui2ozgttyzfb3jdubljmk7yl3e" style="color: black;">EURO Journal on Transportation and Logistics</a> </i> &nbsp;
We present and discuss the basic problem of this class, where one vehicle only is available. Then, we consider the extension of this problem to the multi-vehicle case.  ...  This tutorial aims at introducing the class of inventory routing problems by explaining its relations with the most classical routing problems and the reasons why the IRP are important and worth of investigation  ...  Yu et al. (2008) studies the case with split deliveries. A heuristic, based on an approximate model of the problem and Lagrangian relaxation, is developed.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s13676-013-0027-z">doi:10.1007/s13676-013-0027-z</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nea3lzfesfhzffzujfswc4pps4">fatcat:nea3lzfesfhzffzujfswc4pps4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130903130420/http://link.springer.com:80/content/pdf/10.1007/s13676-013-0027-z.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bd/3a/bd3ad3ac7844e38d3d8e8278d7e77b6535c8463f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s13676-013-0027-z"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,513 results