Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery : A Cooperative Approach
This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collectio...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Berghida, Meryem [verfasserIn] Boukra, Abdelmadjid [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Umfang: |
1 Online-Ressource |
|---|
| Übergeordnetes Werk: |
Enthalten in: International journal of applied metaheuristic computing - Hershey, Pa : IGI Global, 2010, 6(2015), 3, Seite 53-68 |
|---|---|
| Übergeordnetes Werk: |
volume:6 ; year:2015 ; number:3 ; pages:53-68 |
| Links: |
|---|
| DOI / URN: |
10.4018/ijamc.2015070103 |
|---|
| Katalog-ID: |
NLEJ251786323 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ251786323 | ||
| 003 | DE-627 | ||
| 005 | 20231205143828.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231128s2015 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.4018/ijamc.2015070103 |2 doi | |
| 035 | |a (DE-627)NLEJ251786323 | ||
| 035 | |a (VZGNL)10.4018/ijamc.2015070103 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Berghida, Meryem |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery |b A Cooperative Approach |
| 264 | 1 | |c 2015 | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality | ||
| 653 | |a Biogeography Based Optimization |a Cooperative Approach |a Genetic Algorithm |a Simulated Annealing |a Simultaneous Pickup and Delivery |a Tabu Search |a Vehicle Routing Problem | ||
| 700 | 1 | |a Boukra, Abdelmadjid |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t International journal of applied metaheuristic computing |d Hershey, Pa : IGI Global, 2010 |g 6(2015), 3, Seite 53-68 |h Online-Ressource |w (DE-627)NLEJ244418616 |w (DE-600)2696224-X |x 1947-8291 |7 nnns |
| 773 | 1 | 8 | |g volume:6 |g year:2015 |g number:3 |g pages:53-68 |
| 856 | 4 | 0 | |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103 |m X:IGIG |x Verlag |z Deutschlandweit zugänglich |
| 856 | 4 | 2 | |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103&buylink=true |3 Abstract |
| 912 | |a ZDB-1-GIS | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 6 |j 2015 |e 3 |h 53-68 | ||
| author_variant |
m b mb a b ab |
|---|---|
| matchkey_str |
article:19478291:2015----::eouinfvhceotnpolmihiutno |
| hierarchy_sort_str |
2015 |
| publishDate |
2015 |
| allfields |
10.4018/ijamc.2015070103 doi (DE-627)NLEJ251786323 (VZGNL)10.4018/ijamc.2015070103 DE-627 ger DE-627 rakwb eng Berghida, Meryem verfasserin aut Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery A Cooperative Approach 2015 1 Online-Ressource Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality Biogeography Based Optimization Cooperative Approach Genetic Algorithm Simulated Annealing Simultaneous Pickup and Delivery Tabu Search Vehicle Routing Problem Boukra, Abdelmadjid verfasserin aut Enthalten in International journal of applied metaheuristic computing Hershey, Pa : IGI Global, 2010 6(2015), 3, Seite 53-68 Online-Ressource (DE-627)NLEJ244418616 (DE-600)2696224-X 1947-8291 nnns volume:6 year:2015 number:3 pages:53-68 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103&buylink=true Abstract ZDB-1-GIS GBV_NL_ARTICLE AR 6 2015 3 53-68 |
| spelling |
10.4018/ijamc.2015070103 doi (DE-627)NLEJ251786323 (VZGNL)10.4018/ijamc.2015070103 DE-627 ger DE-627 rakwb eng Berghida, Meryem verfasserin aut Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery A Cooperative Approach 2015 1 Online-Ressource Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality Biogeography Based Optimization Cooperative Approach Genetic Algorithm Simulated Annealing Simultaneous Pickup and Delivery Tabu Search Vehicle Routing Problem Boukra, Abdelmadjid verfasserin aut Enthalten in International journal of applied metaheuristic computing Hershey, Pa : IGI Global, 2010 6(2015), 3, Seite 53-68 Online-Ressource (DE-627)NLEJ244418616 (DE-600)2696224-X 1947-8291 nnns volume:6 year:2015 number:3 pages:53-68 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103&buylink=true Abstract ZDB-1-GIS GBV_NL_ARTICLE AR 6 2015 3 53-68 |
| allfields_unstemmed |
10.4018/ijamc.2015070103 doi (DE-627)NLEJ251786323 (VZGNL)10.4018/ijamc.2015070103 DE-627 ger DE-627 rakwb eng Berghida, Meryem verfasserin aut Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery A Cooperative Approach 2015 1 Online-Ressource Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality Biogeography Based Optimization Cooperative Approach Genetic Algorithm Simulated Annealing Simultaneous Pickup and Delivery Tabu Search Vehicle Routing Problem Boukra, Abdelmadjid verfasserin aut Enthalten in International journal of applied metaheuristic computing Hershey, Pa : IGI Global, 2010 6(2015), 3, Seite 53-68 Online-Ressource (DE-627)NLEJ244418616 (DE-600)2696224-X 1947-8291 nnns volume:6 year:2015 number:3 pages:53-68 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103&buylink=true Abstract ZDB-1-GIS GBV_NL_ARTICLE AR 6 2015 3 53-68 |
| allfieldsGer |
10.4018/ijamc.2015070103 doi (DE-627)NLEJ251786323 (VZGNL)10.4018/ijamc.2015070103 DE-627 ger DE-627 rakwb eng Berghida, Meryem verfasserin aut Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery A Cooperative Approach 2015 1 Online-Ressource Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality Biogeography Based Optimization Cooperative Approach Genetic Algorithm Simulated Annealing Simultaneous Pickup and Delivery Tabu Search Vehicle Routing Problem Boukra, Abdelmadjid verfasserin aut Enthalten in International journal of applied metaheuristic computing Hershey, Pa : IGI Global, 2010 6(2015), 3, Seite 53-68 Online-Ressource (DE-627)NLEJ244418616 (DE-600)2696224-X 1947-8291 nnns volume:6 year:2015 number:3 pages:53-68 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103&buylink=true Abstract ZDB-1-GIS GBV_NL_ARTICLE AR 6 2015 3 53-68 |
| allfieldsSound |
10.4018/ijamc.2015070103 doi (DE-627)NLEJ251786323 (VZGNL)10.4018/ijamc.2015070103 DE-627 ger DE-627 rakwb eng Berghida, Meryem verfasserin aut Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery A Cooperative Approach 2015 1 Online-Ressource Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality Biogeography Based Optimization Cooperative Approach Genetic Algorithm Simulated Annealing Simultaneous Pickup and Delivery Tabu Search Vehicle Routing Problem Boukra, Abdelmadjid verfasserin aut Enthalten in International journal of applied metaheuristic computing Hershey, Pa : IGI Global, 2010 6(2015), 3, Seite 53-68 Online-Ressource (DE-627)NLEJ244418616 (DE-600)2696224-X 1947-8291 nnns volume:6 year:2015 number:3 pages:53-68 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103&buylink=true Abstract ZDB-1-GIS GBV_NL_ARTICLE AR 6 2015 3 53-68 |
| language |
English |
| source |
Enthalten in International journal of applied metaheuristic computing 6(2015), 3, Seite 53-68 volume:6 year:2015 number:3 pages:53-68 |
| sourceStr |
Enthalten in International journal of applied metaheuristic computing 6(2015), 3, Seite 53-68 volume:6 year:2015 number:3 pages:53-68 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Biogeography Based Optimization Cooperative Approach Genetic Algorithm Simulated Annealing Simultaneous Pickup and Delivery Tabu Search Vehicle Routing Problem |
| isfreeaccess_bool |
false |
| container_title |
International journal of applied metaheuristic computing |
| authorswithroles_txt_mv |
Berghida, Meryem @@aut@@ Boukra, Abdelmadjid @@aut@@ |
| publishDateDaySort_date |
2015-01-01T00:00:00Z |
| hierarchy_top_id |
NLEJ244418616 |
| id |
NLEJ251786323 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ251786323</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231205143828.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231128s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/ijamc.2015070103</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ251786323</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VZGNL)10.4018/ijamc.2015070103</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Berghida, Meryem</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery</subfield><subfield code="b">A Cooperative Approach</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Biogeography Based Optimization</subfield><subfield code="a">Cooperative Approach</subfield><subfield code="a">Genetic Algorithm</subfield><subfield code="a">Simulated Annealing</subfield><subfield code="a">Simultaneous Pickup and Delivery</subfield><subfield code="a">Tabu Search</subfield><subfield code="a">Vehicle Routing Problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Boukra, Abdelmadjid</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of applied metaheuristic computing</subfield><subfield code="d">Hershey, Pa : IGI Global, 2010</subfield><subfield code="g">6(2015), 3, Seite 53-68</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ244418616</subfield><subfield code="w">(DE-600)2696224-X</subfield><subfield code="x">1947-8291</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:6</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:53-68</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103</subfield><subfield code="m">X:IGIG</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103&buylink=true</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-GIS</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">6</subfield><subfield code="j">2015</subfield><subfield code="e">3</subfield><subfield code="h">53-68</subfield></datafield></record></collection>
|
| author |
Berghida, Meryem |
| spellingShingle |
Berghida, Meryem misc Biogeography Based Optimization Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery A Cooperative Approach |
| authorStr |
Berghida, Meryem |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ244418616 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1947-8291 |
| topic_title |
Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery A Cooperative Approach |
| topic |
misc Biogeography Based Optimization |
| topic_unstemmed |
misc Biogeography Based Optimization |
| topic_browse |
misc Biogeography Based Optimization |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
International journal of applied metaheuristic computing |
| hierarchy_parent_id |
NLEJ244418616 |
| hierarchy_top_title |
International journal of applied metaheuristic computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ244418616 (DE-600)2696224-X |
| title |
Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery A Cooperative Approach |
| ctrlnum |
(DE-627)NLEJ251786323 (VZGNL)10.4018/ijamc.2015070103 |
| title_full |
Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery A Cooperative Approach |
| author_sort |
Berghida, Meryem |
| journal |
International journal of applied metaheuristic computing |
| journalStr |
International journal of applied metaheuristic computing |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| container_start_page |
53 |
| author_browse |
Berghida, Meryem Boukra, Abdelmadjid |
| container_volume |
6 |
| physical |
1 Online-Ressource |
| format_se |
Elektronische Aufsätze |
| author-letter |
Berghida, Meryem |
| title_sub |
A Cooperative Approach |
| doi_str_mv |
10.4018/ijamc.2015070103 |
| author2-role |
verfasserin |
| title_sort |
resolution of a vehicle routing problem with simultaneous pickup and deliverya cooperative approach |
| title_auth |
Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery A Cooperative Approach |
| abstract |
This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality |
| abstractGer |
This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality |
| abstract_unstemmed |
This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality |
| collection_details |
ZDB-1-GIS GBV_NL_ARTICLE |
| container_issue |
3 |
| title_short |
Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery |
| url |
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103&buylink=true |
| remote_bool |
true |
| author2 |
Boukra, Abdelmadjid |
| author2Str |
Boukra, Abdelmadjid |
| ppnlink |
NLEJ244418616 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.4018/ijamc.2015070103 |
| up_date |
2024-07-06T11:36:17.639Z |
| _version_ |
1803829408066174976 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ251786323</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231205143828.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231128s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/ijamc.2015070103</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ251786323</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VZGNL)10.4018/ijamc.2015070103</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Berghida, Meryem</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery</subfield><subfield code="b">A Cooperative Approach</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Biogeography Based Optimization</subfield><subfield code="a">Cooperative Approach</subfield><subfield code="a">Genetic Algorithm</subfield><subfield code="a">Simulated Annealing</subfield><subfield code="a">Simultaneous Pickup and Delivery</subfield><subfield code="a">Tabu Search</subfield><subfield code="a">Vehicle Routing Problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Boukra, Abdelmadjid</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of applied metaheuristic computing</subfield><subfield code="d">Hershey, Pa : IGI Global, 2010</subfield><subfield code="g">6(2015), 3, Seite 53-68</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ244418616</subfield><subfield code="w">(DE-600)2696224-X</subfield><subfield code="x">1947-8291</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:6</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:53-68</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103</subfield><subfield code="m">X:IGIG</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015070103&buylink=true</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-GIS</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">6</subfield><subfield code="j">2015</subfield><subfield code="e">3</subfield><subfield code="h">53-68</subfield></datafield></record></collection>
|
| score |
7.398695 |