Pick-Up and Delivery Problem for Sequentially Consolidated Urban Transportation with Mixed and Multi-Pupropse Vehicle Fleet

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Sökning: L773:0197 6729 OR L773:2042 3195 > Pick-Up and Deliver...

LIBRIS Formathandbok (Information om MARC21)

Fältnamn	Indikatorer	Metadata
000		03154naa a2200313 4500
001		oai:DiVA.org:kth-310768
003		SwePub
008		220407s2022 \| \|\|\|\|\|\|\|\|\|\|\|000 \|\|eng\|
024	7	a https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3107682 URI
024	7	a https://doi.org/10.1155/2022/29205322 DOI
040		a (SwePub)kth
041		a engb eng
042		9 SwePub
072	7	a ref2 swepub-contenttype
072	7	a art2 swepub-publicationtype
100	1	a Chen, Haoyeu KTH,Skolan för arkitektur och samhällsbyggnad (ABE)4 aut0 (Swepub:kth)u173pnic
245	1 0	a Pick-Up and Delivery Problem for Sequentially Consolidated Urban Transportation with Mixed and Multi-Pupropse Vehicle Fleet
264	1	b Hindawi Limited,c 2022
338		a print2 rdacarrier
500		a QC 20220407
520		a Different urban transportation flows (e.g., passenger journeys, freight distribution, and waste management) are conventionally separately handled by corresponding single-purpose vehicles (SVs). The multi-purpose vehicle (MV) is a novel vehicle concept that can enable the sequential sharing of different transportation flows by changing the so-called modules, thus theoretically improving the efficiency of urban transportation through the utilization of higher vehicles. In this study, a variant of the pick-up and delivery problem with time windows is established to describe the sequential sharing problem considering both MVs and SVs with features of multiple depots, partial recharging strategies, and fleet sizing. MVs can change their load modules to carry all item types that can also be carried by SVs. To solve the routing problem, an adaptive large neighborhood search (ALNS) algorithm is developed with new problem-specific heuristics. The proposed ALNS is tested on 15 small-size cases and evaluated using a commercial MIP solver. Results show that the proposed algorithm is time-efficient and able to generate robust and high-quality solutions. We investigate the performance of the ALNS algorithm by analyzing convergence and selection probabilities of the heuristic solution that destroy and repair operators. On 15 large-size instances, we compare results for pure SV, pure MV, and mixed fleets, showing that the introduction of MVs can allow smaller fleet sizes while approximately keeping the same total travel distance as for pure SVs.
650	7	a TEKNIK OCH TEKNOLOGIERx Samhällsbyggnadsteknikx Transportteknik och logistik0 (SwePub)201052 hsv//swe
650	7	a ENGINEERING AND TECHNOLOGYx Civil Engineeringx Transport Systems and Logistics0 (SwePub)201052 hsv//eng
700	1	a Hatzenbühler, Jonasu KTH,Transportplanering4 aut0 (Swepub:kth)u1to5689
700	1	a Jenelius, Erik,c Docent,d 1980-u KTH,Transportplanering,Div Transport Planning, Brinellvagen 23, S-10044 Stockholm, Sweden.4 aut0 (Swepub:kth)u1x5t81f
710	2	a KTHb Skolan för arkitektur och samhällsbyggnad (ABE)4 org
773	0	t Journal of Advanced Transportationd : Hindawi Limitedg 2022q 2022x 0197-6729x 2042-3195
856	4 8	u https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-310768
856	4 8	u https://doi.org/10.1155/2022/2920532

Hitta via bibliotek

Journal of Advanced Transportation (Sök värdpublikationen i LIBRIS)

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...: Chen, Haoye; Hatzenbühler, Jo ...; Jenelius, Erik, ...

Om ämnet

TEKNIK OCH TEKNOLOGIER: TEKNIK OCH TEKNO ...; och Samhällsbyggnads ...; och Transportteknik ...

Artiklar i publikationen: Journal of Advan ...

Av lärosätet: Kungliga Tekniska Högskolan

Sök utanför SwePub

Sök vidare i:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se