logo
logo
x
바코드검색
BOOKPRICE.co.kr
책, 도서 가격비교 사이트
바코드검색

인기 검색어

일간
|
주간
|
월간

실시간 검색어

검색가능 서점

도서목록 제공

Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems, Second Edition

Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems, Second Edition (Hardcover, 2)

Edward Tsang (지은이)
CRC Pr I Llc
273,120원

일반도서

검색중
서점 할인가 할인률 배송비 혜택/추가 실질최저가 구매하기
알라딘 로딩중
yes24 로딩중
교보문고 로딩중
notice_icon 검색 결과 내에 다른 책이 포함되어 있을 수 있습니다.

중고도서

검색중
서점 유형 등록개수 최저가 구매하기
로딩중

eBook

검색중
서점 정가 할인가 마일리지 실질최저가 구매하기
로딩중

책 이미지

Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems, Second Edition
eBook 미리보기

책 정보

· 제목 : Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems, Second Edition (Hardcover, 2) 
· 분류 : 외국도서 > 경제경영 > 구매
· ISBN : 9781498732536
· 쪽수 : 260쪽
· 출판일 : 2015-08-14

목차

Introduction
Objectives
Optimization in Ports
Scheduling of AGVs and Development of Advanced Algorithms
Structure of Subsequent Chapters

Problems in Container Terminals
Compartments
Operations
Decisions to Be Made
Allocation of Berths to Arriving Vessels and QCs to Docked Vessels
Storage Space Assignment
RTGC Deployment
Scheduling and Routing of Vehicles
Appointment Times to External Trucks

Formulations of the Problems and Solutions
Allocation of Berths to Arriving Vessels and QCs to Docked Vessels
Assumptions
Decision Variables and Domains
Constraints
Objective Function

Storage Space Assignment
Assumptions
Decision Variables and Domains
Constraints
Objective Function

RTGC Deployment
Assumptions
Decision Variables and Domains
Constraints
Objective Function

Scheduling and Routing of Vehicles
Assumptions
Decision Variables and Domains
Constraints
Objective Function
Appointment Times to External Trucks
Assumptions
Decision Variables and Domains
Constraints
Objective Function

Container Terminals over the World, a Survey
Survey on Simulation, Implementation, Solution Methods, and Evaluation
Simulation and Setting the Parameters
Selecting an Architecture
Solution Methods, a Survey
Evaluation and Monitoring
Summary and Conclusion

Vehicle Scheduling: A Minimum Cost Flow Problem
Reasons to Choose This Problem
Assumptions
Variables and Notations
MCF Model
Graph Terminology
Standard Form of the MCF Model
Applications of the MCF Model

Special Case of the MCF Model for AGV Scheduling
Nodes and Their Properties in the Special Graph
Arcs and Their Properties in the Special Graph
MCF-AGV Model for the AGV Scheduling

Summary and Conclusion

Network Simplex: The Fastest Algorithm
Reasons to Choose NSA
Network Simplex Algorithm
Spanning Tree Solutions and Optimality Conditions
Steps of NSA
Difference between NSA and Original Simplex
Short Literature over Pricing Rules
Strongly Feasible Spanning Tree

Simulation Software
Features of Our Software
Implementation of NSA in Our Software
How the Program Works
Circulation Problem

Experimental Results
Estimate of the Algorithm’s Complexity in Practice
Limitation of the NSA in Practice
Summary and Conclusion

Network Simplex Plus: Complete Advanced Algorithm
Motivation
Network Simplex Plus Algorithm
Anti-Cycling in NSA+
Memory Technique and Heuristic Approach in NSA+
Differences between NSA and NSA+

Comparison between NSA and NSA+
Statistical Test for the Comparison
Complexity of NSA+
Software Architecture for Dynamic Aspect
Experimental Results from the Dynamic Aspect
Summary and Conclusion

Dynamic Network Simplex: Dynamic Complete Advanced Algorithm
Motivation
Classification of Graph Algorithms and Dynamic Flow Model
Dynamic Network Simplex Algorithm
Data Structures
Memory Management
DNSA and DNSA+

Software Architecture for Dynamic Aspect
Comparison between DNSA+ and NSA+
Statistical Test for the Comparison
Complexity of the Algorithm
Summary and Conclusion

Greedy Vehicle Search: An Incomplete Advanced Algorithm
Motivation
Problem Formalization
Nodes and Their Properties in the Incomplete Graph
Arcs and Their Properties in the Incomplete Graph
Special Case of the MCF-AGV Model for AGV Scheduling

Algorithm Formalization
Software Architecture for Dynamic Aspect
Comparison between GVS and NSA+ and Quality of the Solutions
Statistical Test for the Comparison
Complexity of GVS
Complexity of GVS for Static Problems
Complexity of GVS for Dynamic Problems

Discussion over GVS and Meta-Heuristic
Summary and Conclusion

Multi-Load and Heterogeneous Vehicle Scheduling: Hybrid Solutions
Motivation
Assumptions and Formulation
Assumptions
Formulation
Decision Variable
Constraints and Objective Function
Solutions to the Problem
SAM for the Multi-Load AGVs
Hybrid of SAM and NSA for Heterogeneous AGVs

Experimental Results
Summary and Conclusion

Conclusions and Future Research
Summary of This Research Done
Observations and Conclusions
Research Contributions
Future Research
Scheduling and Routing of the Vehicles
Economic and Optimization Model
Other Possible Extension


Appendix: Information on the Web

References
Index

이 포스팅은 쿠팡 파트너스 활동의 일환으로,
이에 따른 일정액의 수수료를 제공받습니다.
이 포스팅은 제휴마케팅이 포함된 광고로 커미션을 지급 받습니다.
도서 DB 제공 : 알라딘 서점(www.aladin.co.kr)
최근 본 책