東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Effective Algorithms for Pickup and Delivery Problem with Loading Restrictions and Handling Costs.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Effective Algorithms for Pickup and Delivery Problem with Loading Restrictions and Handling Costs./
作者:	Radha Krishnan, Devaraja Vignesh.
面頁冊數:	1 online resource (143 pages)
附註:	Source: Dissertations Abstracts International, Volume: 82-12, Section: B.
Contained By:	Dissertations Abstracts International82-12B.
標題:	Industrial engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28259306click for full text (PQDT)
ISBN:	9798738651458

Effective Algorithms for Pickup and Delivery Problem with Loading Restrictions and Handling Costs.
Radha Krishnan, Devaraja Vignesh.

Effective Algorithms for Pickup and Delivery Problem with Loading Restrictions and Handling Costs. - 1 online resource (143 pages)

Source: Dissertations Abstracts International, Volume: 82-12, Section: B.

Thesis (Ph.D.)--Oklahoma State University, 2020.

Includes bibliographical references

The Pickup-and-Delivery problem is an important category of Vehicle Routing Problem with a lot of practical applications. In practice, the problems in this category often have to be solved with cargo loading/unloading restrictions. For example, shippers may incur cargo handling costs if a driver has to unload and reload pallets into the vehicle at shipment delivery sites. However, this cost can be eliminated by following the Last-In-First-Out (LIFO) order for cargo loading/unloading. Motivated by this application, we explore the Pickup-and-Delivery Problem (PDP) with LIFO loading restrictions in single and multi-vehicle settings. We also study the PDP with handling costs in single and multi-vehicle settings because strictly imposing the LIFO order might force the vehicles to travel long distances. For single-vehicle problems, we present multiple mathematical models and branch-and-cut algorithms. We also introduce new inequalities, warm start, and bound tightening procedures to enhance the scalability of our implementations. The multi-vehicle problems are formulated and solved with many practical considerations including vehicle capacity, customer time windows, and maximum on-road time for drivers. We also propose new heuristic algorithms which were very effective in solving the multi-vehicle problems. This dissertation also introduces new conditional integral separation procedures which could be applicable in large scale mathematical models outside the vehicle routing discipline.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2023

Mode of access: World Wide Web

ISBN: 9798738651458Subjects--Topical Terms:

526216
Industrial engineering.
Subjects--Index Terms:

Branch-and-cutIndex Terms--Genre/Form:

542853
Electronic books.

Effective Algorithms for Pickup and Delivery Problem with Loading Restrictions and Handling Costs.
LDR:03195nmm a2200517K 4500 001 2353297
005 20230306113754.5
006 m o d
007 cr mn ---uuuuu
008 241011s2020 xx obm 000 0 eng d
020 $a 9798738651458
035 $a (MiAaPQ)AAI28259306
035 $a AAI28259306
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Radha Krishnan, Devaraja Vignesh. $3 3693640
245 1 0 $a Effective Algorithms for Pickup and Delivery Problem with Loading Restrictions and Handling Costs.
264 0 $c 2020
300 $a 1 online resource (143 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 82-12, Section: B.
500 $a Advisor: Liu, Tieming.
502 $a Thesis (Ph.D.)--Oklahoma State University, 2020.
504 $a Includes bibliographical references
520 $a The Pickup-and-Delivery problem is an important category of Vehicle Routing Problem with a lot of practical applications. In practice, the problems in this category often have to be solved with cargo loading/unloading restrictions. For example, shippers may incur cargo handling costs if a driver has to unload and reload pallets into the vehicle at shipment delivery sites. However, this cost can be eliminated by following the Last-In-First-Out (LIFO) order for cargo loading/unloading. Motivated by this application, we explore the Pickup-and-Delivery Problem (PDP) with LIFO loading restrictions in single and multi-vehicle settings. We also study the PDP with handling costs in single and multi-vehicle settings because strictly imposing the LIFO order might force the vehicles to travel long distances. For single-vehicle problems, we present multiple mathematical models and branch-and-cut algorithms. We also introduce new inequalities, warm start, and bound tightening procedures to enhance the scalability of our implementations. The multi-vehicle problems are formulated and solved with many practical considerations including vehicle capacity, customer time windows, and maximum on-road time for drivers. We also propose new heuristic algorithms which were very effective in solving the multi-vehicle problems. This dissertation also introduces new conditional integral separation procedures which could be applicable in large scale mathematical models outside the vehicle routing discipline.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2023
538 $a Mode of access: World Wide Web
650 4 $a Industrial engineering. $3 526216
650 4 $a Transportation. $3 555912
650 4 $a Applied mathematics. $3 2122814
650 4 $a Violations. $3 3558956
650 4 $a Integer programming. $3 648270
650 4 $a Trucks. $3 573590
650 4 $a Dissertations & theses. $3 3560115
650 4 $a Heuristic. $3 568476
650 4 $a Vehicles. $3 2145288
650 4 $a Disaster relief. $3 582492
650 4 $a Travel. $3 585743
650 4 $a Literature reviews. $3 3559998
650 4 $a Algorithms. $3 536374
650 4 $a Traveling salesman problem. $3 3448648
653 $a Branch-and-cut
653 $a Heuristic
653 $a Last-in-first-out
653 $a Mixed integer programming
653 $a Pickup-and-delivery
653 $a Vehicle routing
653 $a Cargo loading
653 $a Unloading restrictions
653 $a Inequalities
653 $a Warm start
653 $a Bound tightening
653 $a Scalability
653 $a Multi-vehicle
655 7 $a Electronic books. $2 lcsh $3 542853
690 $a 0546
690 $a 0796
690 $a 0709
690 $a 0454
690 $a 0364
710 2 $a ProQuest Information and Learning Co. $3 783688
710 2 $a Oklahoma State University. $b Industrial Engineering & Management. $3 1065143
773 0 $t Dissertations Abstracts International $g 82-12B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28259306 $z click for full text (PQDT)