大葉大學圖書館 |

Optimizing liner shipping fleet repositioning plans[electronic resource] /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	623.89
書名/作者:	Optimizing liner shipping fleet repositioning plans/ by Kevin Tierney.
作者:	Tierney, Kevin.
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	viii, 182 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Optimum ship routing.
標題:	Electronics in navigation.
標題:	Cargo ships.
標題:	Economics/Management Science.
標題:	Operation Research/Decision Theory.
標題:	Production/Logistics/Supply Chain Management.
標題:	International Economics.
ISBN:	9783319176659 (electronic bk.)
ISBN:	9783319176642 (paper)
內容註:	Introduction -- Containerized Shipping -- Liner Shipping Fleet Repositioning -- Methodological Background -- Liner Shipping Fleet Repositioning without Cargo -- Liner Shipping Fleet Repositioning with Cargo -- Conclusion.
摘要、提要註:	This monograph addresses several critical problems to the operations of shipping lines and ports, and provides algorithms and mathematical models for use by shipping lines and port authorities for decision support. One of these problems is the repositioning of container ships in a liner shipping network in order to adjust the network to seasonal shifts in demand or changes in the world economy. We provide the first problem description and mathematical model of repositioning and define the liner shipping fleet repositioning problem (LSFRP) The LSFRP is characterized by chains of interacting activities with a multi-commodity flow over paths defined by the activities chosen. We first model the problem without cargo flows with a variety of well-known optimization techniques, as well as using a novel method called linear temporal optimization planning that combines linear programming with partial-order planning in a branch-and-bound framework. We then model the LSFRP with cargo flows, using several different mathematical models as well as two heuristic approaches. We evaluate our techniques on a real-world dataset that includes a scenario from our industrial collaborator. We show that our approaches scale to the size of problems faced by industry, and are also able to improve the profit on the reference scenario by over US$14 million.
電子資源:	http://dx.doi.org/10.1007/978-3-319-17665-9

Optimizing liner shipping fleet repositioning plans[electronic resource] /
Tierney, Kevin.

Optimizing liner shipping fleet repositioning plans[electronic resource] /by Kevin Tierney. - Cham :Springer International Publishing :2015. - viii, 182 p. :ill., digital ;24 cm. - Operations research/computer science interfaces series,v.571387-666X ;. - Operations research/computer science interfaces series ;v.55..

Introduction -- Containerized Shipping -- Liner Shipping Fleet Repositioning -- Methodological Background -- Liner Shipping Fleet Repositioning without Cargo -- Liner Shipping Fleet Repositioning with Cargo -- Conclusion.

This monograph addresses several critical problems to the operations of shipping lines and ports, and provides algorithms and mathematical models for use by shipping lines and port authorities for decision support. One of these problems is the repositioning of container ships in a liner shipping network in order to adjust the network to seasonal shifts in demand or changes in the world economy. We provide the first problem description and mathematical model of repositioning and define the liner shipping fleet repositioning problem (LSFRP) The LSFRP is characterized by chains of interacting activities with a multi-commodity flow over paths defined by the activities chosen. We first model the problem without cargo flows with a variety of well-known optimization techniques, as well as using a novel method called linear temporal optimization planning that combines linear programming with partial-order planning in a branch-and-bound framework. We then model the LSFRP with cargo flows, using several different mathematical models as well as two heuristic approaches. We evaluate our techniques on a real-world dataset that includes a scenario from our industrial collaborator. We show that our approaches scale to the size of problems faced by industry, and are also able to improve the profit on the reference scenario by over US$14 million.

ISBN: 9783319176659 (electronic bk.)

Standard No.: 10.1007/978-3-319-17665-9doiSubjects--Topical Terms:

626894
Optimum ship routing.

LC Class. No.: VK570

Dewey Class. No.: 623.89

Optimizing liner shipping fleet repositioning plans[electronic resource] /
LDR:02614nam a2200337 a 4500 001 439198
003 DE-He213
005 20160113132214.0
006 m d
007 cr nn 008maaau
008 160322s2015 gw s 0 eng d
020 $a 9783319176659 (electronic bk.)
020 $a 9783319176642 (paper)
024 7 $a 10.1007/978-3-319-17665-9 $2 doi
035 $a 978-3-319-17665-9
040 $a GP $c GP
041 0 $a eng
050 4 $a VK570
072 7 $a KJT $2 bicssc
072 7 $a KJMD $2 bicssc
072 7 $a BUS049000 $2 bisacsh
082 0 4 $a 623.89 $2 23
090 $a VK570 $b .T564 2015
100 1 $a Tierney, Kevin. $3 626893
245 1 0 $a Optimizing liner shipping fleet repositioning plans $h [electronic resource] / $c by Kevin Tierney.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a viii, 182 p. : $b ill., digital ; $c 24 cm.
490 1 $a Operations research/computer science interfaces series, $x 1387-666X ; $v v.57
505 0 $a Introduction -- Containerized Shipping -- Liner Shipping Fleet Repositioning -- Methodological Background -- Liner Shipping Fleet Repositioning without Cargo -- Liner Shipping Fleet Repositioning with Cargo -- Conclusion.
520 $a This monograph addresses several critical problems to the operations of shipping lines and ports, and provides algorithms and mathematical models for use by shipping lines and port authorities for decision support. One of these problems is the repositioning of container ships in a liner shipping network in order to adjust the network to seasonal shifts in demand or changes in the world economy. We provide the first problem description and mathematical model of repositioning and define the liner shipping fleet repositioning problem (LSFRP) The LSFRP is characterized by chains of interacting activities with a multi-commodity flow over paths defined by the activities chosen. We first model the problem without cargo flows with a variety of well-known optimization techniques, as well as using a novel method called linear temporal optimization planning that combines linear programming with partial-order planning in a branch-and-bound framework. We then model the LSFRP with cargo flows, using several different mathematical models as well as two heuristic approaches. We evaluate our techniques on a real-world dataset that includes a scenario from our industrial collaborator. We show that our approaches scale to the size of problems faced by industry, and are also able to improve the profit on the reference scenario by over US$14 million.
650 0 $a Optimum ship routing. $3 626894
650 0 $a Electronics in navigation. $3 416636
650 0 $a Cargo ships. $3 626895
650 1 4 $a Economics/Management Science. $3 463465
650 2 4 $a Operation Research/Decision Theory. $3 511310
650 2 4 $a Production/Logistics/Supply Chain Management. $3 463855
650 2 4 $a International Economics. $3 463712
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Operations research/computer science interfaces series ; $v v.55. $3 603082
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-17665-9
950 $a Business and Economics (Springer-11643)