An Approximate Dynamic Programming Approach for a Routing Problem with Simultaneous Pick-Ups and Deliveries in Urban Areas

Mustafa Çimen; Çagri Sel; Mehmet Soysal

doi:10.1007/978-3-030-34065-0_4

An Approximate Dynamic Programming Approach for a Routing Problem with Simultaneous Pick-Ups and Deliveries in Urban Areas

Karabuk University

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

2 Citations (Scopus)

Abstract

This chapter addresses vehicle routing problems with simultaneous pickups and deliveries, and time-dependent vehicle speeds, particularly confronted in the soft-drink distribution in urban areas. The conducted review provides a state-of-the-art assessment of the literature on soft-drink supply chain to reveal the recent developments. Furthermore, a real-life case is examined to address a common reverse logistics problem of collecting/reusing the reusable empty soda bottles encountered in the soft-drink industry. The problem has been formulated and solved by means of an adaptation of a recent Approximate Dynamic Programming based optimisation algorithm. The study highlights a great potential of sustainable supply chain management practices in the field. The study could be useful not only for researchers studying the topic, but also for practitioners in the soft-drink industry.

Original language	English
Title of host publication	Food Supply Chains in Cities
Subtitle of host publication	Modern Tools for Circularity and Sustainability
Publisher	Springer International Publishing
Pages	101-143
Number of pages	43
ISBN (Electronic)	9783030340650
ISBN (Print)	9783030340643
DOIs	https://doi.org/10.1007/978-3-030-34065-0_4
Publication status	Published - 1 Jan 2020

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 12 Responsible Consumption and Production

Keywords

Approximate Dynamic Programming
Closed distribution networks
Pick-up and delivery problem
Sustainable urban food logistics
Time-dependent vehicle speeds

Access to Document

10.1007/978-3-030-34065-0_4

Cite this

@inbook{805213e3a88a472094e4c253d6403fa5,

title = "An Approximate Dynamic Programming Approach for a Routing Problem with Simultaneous Pick-Ups and Deliveries in Urban Areas",

abstract = "This chapter addresses vehicle routing problems with simultaneous pickups and deliveries, and time-dependent vehicle speeds, particularly confronted in the soft-drink distribution in urban areas. The conducted review provides a state-of-the-art assessment of the literature on soft-drink supply chain to reveal the recent developments. Furthermore, a real-life case is examined to address a common reverse logistics problem of collecting/reusing the reusable empty soda bottles encountered in the soft-drink industry. The problem has been formulated and solved by means of an adaptation of a recent Approximate Dynamic Programming based optimisation algorithm. The study highlights a great potential of sustainable supply chain management practices in the field. The study could be useful not only for researchers studying the topic, but also for practitioners in the soft-drink industry.",

keywords = "Approximate Dynamic Programming, Closed distribution networks, Pick-up and delivery problem, Sustainable urban food logistics, Time-dependent vehicle speeds",

author = "Mustafa {\c C}imen and {\c C}agri Sel and Mehmet Soysal",

note = "Publisher Copyright: {\textcopyright} The Author(s) 2020.",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-3-030-34065-0\_4",

language = "English",

isbn = "9783030340643",

pages = "101--143",

booktitle = "Food Supply Chains in Cities",

publisher = "Springer International Publishing",

address = "Switzerland",

}

An Approximate Dynamic Programming Approach for a Routing Problem with Simultaneous Pick-Ups and Deliveries in Urban Areas. / Çimen, Mustafa; Sel, Çagri; Soysal, Mehmet.
Food Supply Chains in Cities: Modern Tools for Circularity and Sustainability. Springer International Publishing, 2020. p. 101-143.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - An Approximate Dynamic Programming Approach for a Routing Problem with Simultaneous Pick-Ups and Deliveries in Urban Areas

AU - Çimen, Mustafa

AU - Sel, Çagri

AU - Soysal, Mehmet

N1 - Publisher Copyright: © The Author(s) 2020.

PY - 2020/1/1

Y1 - 2020/1/1

N2 - This chapter addresses vehicle routing problems with simultaneous pickups and deliveries, and time-dependent vehicle speeds, particularly confronted in the soft-drink distribution in urban areas. The conducted review provides a state-of-the-art assessment of the literature on soft-drink supply chain to reveal the recent developments. Furthermore, a real-life case is examined to address a common reverse logistics problem of collecting/reusing the reusable empty soda bottles encountered in the soft-drink industry. The problem has been formulated and solved by means of an adaptation of a recent Approximate Dynamic Programming based optimisation algorithm. The study highlights a great potential of sustainable supply chain management practices in the field. The study could be useful not only for researchers studying the topic, but also for practitioners in the soft-drink industry.

AB - This chapter addresses vehicle routing problems with simultaneous pickups and deliveries, and time-dependent vehicle speeds, particularly confronted in the soft-drink distribution in urban areas. The conducted review provides a state-of-the-art assessment of the literature on soft-drink supply chain to reveal the recent developments. Furthermore, a real-life case is examined to address a common reverse logistics problem of collecting/reusing the reusable empty soda bottles encountered in the soft-drink industry. The problem has been formulated and solved by means of an adaptation of a recent Approximate Dynamic Programming based optimisation algorithm. The study highlights a great potential of sustainable supply chain management practices in the field. The study could be useful not only for researchers studying the topic, but also for practitioners in the soft-drink industry.

KW - Approximate Dynamic Programming

KW - Closed distribution networks

KW - Pick-up and delivery problem

KW - Sustainable urban food logistics

KW - Time-dependent vehicle speeds

UR - https://www.scopus.com/pages/publications/85097737653

U2 - 10.1007/978-3-030-34065-0_4

DO - 10.1007/978-3-030-34065-0_4

M3 - Chapter

AN - SCOPUS:85097737653

SN - 9783030340643

SP - 101

EP - 143

BT - Food Supply Chains in Cities

PB - Springer International Publishing

ER -

An Approximate Dynamic Programming Approach for a Routing Problem with Simultaneous Pick-Ups and Deliveries in Urban Areas

Abstract

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this