Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex
This paper addresses a real-life logistic problem arising in the hospital complex of Tours (France). The two-level vehicle routing problem has time windows, a heterogeneous fleet, and multi-depot, multi-commodity and split deliveries. The first level concerns the routing problem for a fleet of vehic...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research 2013-10, Vol.40 (10), p.2508-2518 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 2518 |
|---|---|
| container_issue | 10 |
| container_start_page | 2508 |
| container_title | Computers & operations research |
| container_volume | 40 |
| creator | Kergosien, Y. Lenté, Ch Billaut, J.-C. Perrin, S. |
| description | This paper addresses a real-life logistic problem arising in the hospital complex of Tours (France). The two-level vehicle routing problem has time windows, a heterogeneous fleet, and multi-depot, multi-commodity and split deliveries. The first level concerns the routing problem for a fleet of vehicles serving several hospital units that delivers medicines, clean linen, meals, various supplies, patient files and picks up waste and dirty linen. The second level concerns the problem of routing employees between buildings within a large hospital unit. Both levels are interconnected. In addition, decisions about sizing and planning the teams of drivers and warehouse employees have to be made. Two metaheuristic algorithms are proposed to solve the entire problem: a genetic algorithm and a tabu search. The algorithms are tested on 100 instances, randomly generated on the basis of real-life instances. |
| doi_str_mv | 10.1016/j.cor.2013.01.009 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1513479191</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054813000178</els_id><sourcerecordid>1513479191</sourcerecordid><originalsourceid>FETCH-LOGICAL-c452t-4e7382ecda9ed3d1ff0e85d75239f0b857420d4d493a1a117d8d870498359a6d3</originalsourceid><addsrcrecordid>eNqFkc2KFDEURgtRsB19AHcBEdxUm5ufSgpXMozOwIgbBXchk9yaTpOutEmq1bc3RQ8uXGg2d3O-7yY5XfcS6BYoDG_3W5fyllHgWwpbSsdH3Qa04r0a5LfH3YZyKnsqhX7aPStlT9tRDDbd9Amr3eGSQ6nBERvvUw51dyhkSpmUFE9hvif1RyJhrphdmmd0FT054S64iCSnpa7IMae7iC0XZmLJLpVjqDYSlw7HiD-fd08mGwu-eJgX3dcPV18ur_vbzx9vLt_f9k5IVnuBimuGztsRPfcwTRS19EoyPk70TkslGPXCi5FbsADKa68VFaPmcrSD5xfdm3Nvu873BUs1h1AcxmhnTEsxIIELNcII_0fFIKQcRsEb-uovdJ-WPLeHGOCKM6YlWwvhTLmcSsk4mWMOB5t_GaBmlWT2pkkyqyRDwTRJLfP6odkWZ-OU7exC-RNkSgx60Gv3uzOH7fNOAbMpLuDs0IfcfBifwj-2_Ab--Kdp</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1373228521</pqid></control><display><type>article</type><title>Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex</title><source>Elsevier ScienceDirect Journals</source><creator>Kergosien, Y. ; Lenté, Ch ; Billaut, J.-C. ; Perrin, S.</creator><creatorcontrib>Kergosien, Y. ; Lenté, Ch ; Billaut, J.-C. ; Perrin, S.</creatorcontrib><description>This paper addresses a real-life logistic problem arising in the hospital complex of Tours (France). The two-level vehicle routing problem has time windows, a heterogeneous fleet, and multi-depot, multi-commodity and split deliveries. The first level concerns the routing problem for a fleet of vehicles serving several hospital units that delivers medicines, clean linen, meals, various supplies, patient files and picks up waste and dirty linen. The second level concerns the problem of routing employees between buildings within a large hospital unit. Both levels are interconnected. In addition, decisions about sizing and planning the teams of drivers and warehouse employees have to be made. Two metaheuristic algorithms are proposed to solve the entire problem: a genetic algorithm and a tabu search. The algorithms are tested on 100 instances, randomly generated on the basis of real-life instances.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2013.01.009</identifier><identifier>CODEN: CMORAP</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>Algorithms ; Applied sciences ; Biological and medical sciences ; Decisions ; Economy. Management ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Genetic algorithms ; Health and social institutions ; Heuristic ; Hospital logistic ; Hospitals ; Linen ; Logistics ; Medical sciences ; Metaheuristic ; Operational research and scientific management ; Operational research. Management science ; Patients ; Planning ; Public health. Hygiene ; Public health. Hygiene-occupational medicine ; Route selection ; Routing ; Studies ; Vehicle routing problem ; Vehicles ; Windows (intervals)</subject><ispartof>Computers & operations research, 2013-10, Vol.40 (10), p.2508-2518</ispartof><rights>2013 Elsevier Ltd</rights><rights>2014 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. Oct 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c452t-4e7382ecda9ed3d1ff0e85d75239f0b857420d4d493a1a117d8d870498359a6d3</citedby><cites>FETCH-LOGICAL-c452t-4e7382ecda9ed3d1ff0e85d75239f0b857420d4d493a1a117d8d870498359a6d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cor.2013.01.009$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,45974</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27468681$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Kergosien, Y.</creatorcontrib><creatorcontrib>Lenté, Ch</creatorcontrib><creatorcontrib>Billaut, J.-C.</creatorcontrib><creatorcontrib>Perrin, S.</creatorcontrib><title>Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex</title><title>Computers & operations research</title><description>This paper addresses a real-life logistic problem arising in the hospital complex of Tours (France). The two-level vehicle routing problem has time windows, a heterogeneous fleet, and multi-depot, multi-commodity and split deliveries. The first level concerns the routing problem for a fleet of vehicles serving several hospital units that delivers medicines, clean linen, meals, various supplies, patient files and picks up waste and dirty linen. The second level concerns the problem of routing employees between buildings within a large hospital unit. Both levels are interconnected. In addition, decisions about sizing and planning the teams of drivers and warehouse employees have to be made. Two metaheuristic algorithms are proposed to solve the entire problem: a genetic algorithm and a tabu search. The algorithms are tested on 100 instances, randomly generated on the basis of real-life instances.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Biological and medical sciences</subject><subject>Decisions</subject><subject>Economy. Management</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Genetic algorithms</subject><subject>Health and social institutions</subject><subject>Heuristic</subject><subject>Hospital logistic</subject><subject>Hospitals</subject><subject>Linen</subject><subject>Logistics</subject><subject>Medical sciences</subject><subject>Metaheuristic</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Patients</subject><subject>Planning</subject><subject>Public health. Hygiene</subject><subject>Public health. Hygiene-occupational medicine</subject><subject>Route selection</subject><subject>Routing</subject><subject>Studies</subject><subject>Vehicle routing problem</subject><subject>Vehicles</subject><subject>Windows (intervals)</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNqFkc2KFDEURgtRsB19AHcBEdxUm5ufSgpXMozOwIgbBXchk9yaTpOutEmq1bc3RQ8uXGg2d3O-7yY5XfcS6BYoDG_3W5fyllHgWwpbSsdH3Qa04r0a5LfH3YZyKnsqhX7aPStlT9tRDDbd9Amr3eGSQ6nBERvvUw51dyhkSpmUFE9hvif1RyJhrphdmmd0FT054S64iCSnpa7IMae7iC0XZmLJLpVjqDYSlw7HiD-fd08mGwu-eJgX3dcPV18ur_vbzx9vLt_f9k5IVnuBimuGztsRPfcwTRS19EoyPk70TkslGPXCi5FbsADKa68VFaPmcrSD5xfdm3Nvu873BUs1h1AcxmhnTEsxIIELNcII_0fFIKQcRsEb-uovdJ-WPLeHGOCKM6YlWwvhTLmcSsk4mWMOB5t_GaBmlWT2pkkyqyRDwTRJLfP6odkWZ-OU7exC-RNkSgx60Gv3uzOH7fNOAbMpLuDs0IfcfBifwj-2_Ab--Kdp</recordid><startdate>20131001</startdate><enddate>20131001</enddate><creator>Kergosien, Y.</creator><creator>Lenté, Ch</creator><creator>Billaut, J.-C.</creator><creator>Perrin, S.</creator><general>Elsevier Ltd</general><general>Elsevier</general><general>Pergamon Press Inc</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7SP</scope></search><sort><creationdate>20131001</creationdate><title>Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex</title><author>Kergosien, Y. ; Lenté, Ch ; Billaut, J.-C. ; Perrin, S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c452t-4e7382ecda9ed3d1ff0e85d75239f0b857420d4d493a1a117d8d870498359a6d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Biological and medical sciences</topic><topic>Decisions</topic><topic>Economy. Management</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Genetic algorithms</topic><topic>Health and social institutions</topic><topic>Heuristic</topic><topic>Hospital logistic</topic><topic>Hospitals</topic><topic>Linen</topic><topic>Logistics</topic><topic>Medical sciences</topic><topic>Metaheuristic</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Patients</topic><topic>Planning</topic><topic>Public health. Hygiene</topic><topic>Public health. Hygiene-occupational medicine</topic><topic>Route selection</topic><topic>Routing</topic><topic>Studies</topic><topic>Vehicle routing problem</topic><topic>Vehicles</topic><topic>Windows (intervals)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kergosien, Y.</creatorcontrib><creatorcontrib>Lenté, Ch</creatorcontrib><creatorcontrib>Billaut, J.-C.</creatorcontrib><creatorcontrib>Perrin, S.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Electronics & Communications Abstracts</collection><jtitle>Computers & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kergosien, Y.</au><au>Lenté, Ch</au><au>Billaut, J.-C.</au><au>Perrin, S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex</atitle><jtitle>Computers & operations research</jtitle><date>2013-10-01</date><risdate>2013</risdate><volume>40</volume><issue>10</issue><spage>2508</spage><epage>2518</epage><pages>2508-2518</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><coden>CMORAP</coden><abstract>This paper addresses a real-life logistic problem arising in the hospital complex of Tours (France). The two-level vehicle routing problem has time windows, a heterogeneous fleet, and multi-depot, multi-commodity and split deliveries. The first level concerns the routing problem for a fleet of vehicles serving several hospital units that delivers medicines, clean linen, meals, various supplies, patient files and picks up waste and dirty linen. The second level concerns the problem of routing employees between buildings within a large hospital unit. Both levels are interconnected. In addition, decisions about sizing and planning the teams of drivers and warehouse employees have to be made. Two metaheuristic algorithms are proposed to solve the entire problem: a genetic algorithm and a tabu search. The algorithms are tested on 100 instances, randomly generated on the basis of real-life instances.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2013.01.009</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2013-10, Vol.40 (10), p.2508-2518 |
| issn | 0305-0548 1873-765X 0305-0548 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1513479191 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithms Applied sciences Biological and medical sciences Decisions Economy. Management Exact sciences and technology Flows in networks. Combinatorial problems Genetic algorithms Health and social institutions Heuristic Hospital logistic Hospitals Linen Logistics Medical sciences Metaheuristic Operational research and scientific management Operational research. Management science Patients Planning Public health. Hygiene Public health. Hygiene-occupational medicine Route selection Routing Studies Vehicle routing problem Vehicles Windows (intervals) |
| title | Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T18%3A45%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Metaheuristic%20algorithms%20for%20solving%20two%20interconnected%20vehicle%20routing%20problems%20in%20a%20hospital%20complex&rft.jtitle=Computers%20&%20operations%20research&rft.au=Kergosien,%20Y.&rft.date=2013-10-01&rft.volume=40&rft.issue=10&rft.spage=2508&rft.epage=2518&rft.pages=2508-2518&rft.issn=0305-0548&rft.eissn=1873-765X&rft.coden=CMORAP&rft_id=info:doi/10.1016/j.cor.2013.01.009&rft_dat=%3Cproquest_cross%3E1513479191%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1373228521&rft_id=info:pmid/&rft_els_id=S0305054813000178&rfr_iscdi=true |