• 한국경영과학회지
• /
• 제24권4호
• /
• pp.63-80
• /
• 1999

In the container transportation of inland depots the empty container is an important issue. The truck dispatching problem in this paper is considered under restriction about empty containers. When a full container arrives in a depot by truck, after unloading operation the full container is changed to an empty container. After loading operation an empty container is changed to a full container. We suggest an integrated approach to the problem of simultaneously managing empty truck and container movements. We suggest an integrated approach to the problem of simultaneously managing empty truck and container movements. We would like to find the truck dispatching method minimizing empty truck movements and empty container movements. In this paper, a mixed integer programming model is developed to obtain the optimal truck dispatching in container transportation and heuristic is developed to give a good solution in much shorter time. The numerical examples are studied and the proposed heuristic is also compared with the result of numerical examples.

• Industrial Engineering and Management Systems
• /
• 제14권1호
• /
• pp.32-43
• /
• 2015

This study suggests an electronic brokerage system that has the capability of efficiently matching dispatching delivery tasks with trucks. In the brokerage system, individual truck drivers and shippers are allowed to participate in the dispatching process through the internet or wireless communication. An auction-based dispatching method for the electronic brokerage system is suggested. The basic rationale of the auction-based dispatching method-which is a distributed decision-making process-is discussed. The performance of the suggested algorithms is evaluated by a simulation study.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2022년도 춘계학술대회
• /
• pp.385-386
• /
• 2022

현재 전세계 해운물류 선진국들은 앞다퉈 자동화 터미널, 공유플랫폼 등 다양한 디지털 기술을 도입하며 스마트항만을 구축하고 있다. 이처럼 자원 활용 효율 향상 및 작업 유휴시간 최소화를 통한 항만 전반에 걸친 효율화의 중요성이 증가하고 있다. 이에 본 연구에서는 자원 활용 효율 향상을 위한 방법의 하나로 개선된 Y/T(Yard Truck) 배차 방식을 제안하고자 한다. 이를 위해, 기존 배차 방식의 문제점을 분석하고 이와 관련한 제약사항을 종합적으로 고려한 Y/T 배차 알고리즘을 개발한다. 또한, 부산 신항 컨테이너터미널 운영 데이터를 기반으로 터미널 혼잡 상황에 따른 다양한 시나리오를 가정하고 시나리오에 대해 기존 배차 방식과 Y/T 배차 알고리즘을 적용한 시뮬레이션 실험을 실시한 후 분석결과를 바탕으로 Y/T 배차 알고리즘 활용에 따른 운영적 효과를 평가한다.

• 경영과학
• /
• 제15권2호
• /
• pp.201-210
• /
• 1998

Truck dispatching is one of the most commonly occurring problems of transprot management. We developed an interactive decision support system named IDSSTD, for the truck dispatching problem where two conflicting objectives are treated and travel speed varies depending on the passing areas and time of day. The IDSSTD aids the decision-making process by allowing the user to interact directly with the database, to direct data to a decision model, and to portray results in a convenient form. The IDSSTD is consisted of two major interactive phases. The pre-scheduling interactive phase is to reduce the complexity of a given problem before applying the BC-saving heuristic algorithm and the post-scheduling interactive phase is to improve practically the algorithmic solution. The IDSSTD has the capabilities of its own manipulation(analysis and recommendation) and diverse graphic features in order to facilitate a user's interaction.

• 대한산업공학회지
• /
• 제23권2호
• /
• pp.275-288
• /
• 1997

The container transportation problem is a kind of generalized pickup and delivery problem(GPDP), and a typical NP-hard problem of which polynomial algorithm has not yet been developed. In this problem, trucks have to transport containers from origins to destinations, while have to satisfy several restrictions such as request time, cargo closing time, driver's break time. In this paper, we present a straightforward heuristic and a user-interactive truck dispatching system which supports decision makers.

• 국제학술발표논문집
• /
• The 4th International Conference on Construction Engineering and Project Management Organized by the University of New South Wales
• /
• pp.187-194
• /
• 2011

Optimizing truck dispatching-intervals is imperative in ready mixed concrete (RMC) delivery process. Intervals shorter than optimal may induce queuing of idle trucks at a construction site, resulting in a long delivery cycle time. On the other hand, intervals longer than optimal can trigger work discontinuity due to a lack of available trucks where required. Therefore, the RMC delivery process should be systematically scheduled in order to minimize the occurrence of waiting trucks as well as guarantee work continuity. However, it is challenging to find optimal intervals, particularly in urban areas, due to variations in both traffic conditions and concrete placement rates at the site. Truck dispatching intervals are usually determined based on the concrete plant managers' intuitive judgments, without sufficient and reliable information regarding traffic and site conditions. Accordingly, the RMC delivery process often experiences inefficiency and/or work discontinuity. Automatic data collection (ADC) techniques (e.g., RFID or GPS) can be effective tools to assist plant managers in finding optimal dispatching intervals, thereby enhancing delivery performance. However, quantitative evidence of the extent of performance improvement has rarely been reported to data, and this is a central reason for a general reluctance within the industry to embrace these techniques, despite their potential benefits. To address this issue, this research reports on the development of a discrete event simulation model and its application to a large-scale building project in Abu Dhabi. The simulation results indicate that ADC techniques can reduce the truck idle time at site by 57% and also enhance the pouring continuity in the RMC delivery process.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2011년도 춘계학술대회
• /
• pp.216-217
• /
• 2011

The problem of automated stacking cranes (ASC) dispatching in container terminals is addressed in this paper. We propose a heuristic-based ASC dispatching approach which adopts multi-criteria decision strategy. By aggregating different criteria the proposed strategy can consider multiple aspects of the dispatching situation and make robust decision in various situations. A multi-objective evolutionary algorithm (MOEA) is adopted to tune the weights associated to each criteria to minimize both the quay crane delay and external truck delay. The proposed approach is validated by comparison with different dispatching heuristics and simulation results obtained confirms its effectiveness.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2002년도 춘계학술대회논문집
• /
• pp.33-41
• /
• 2002

This paper deals with the development of simulation model for the container terminal consisting of 3 berths, 8 container cranes, 16 yard blocks with each yard cranes and 90 yard trucks in order to evaluate the various operational rules. The proposed operational rules are 3 ship dispatching rules, 3 berth allocation rules, 2 crane allocation rules, 2 yard allocation rules and 2 yard truck allocation rules and 4 performance measures like ship time in the terminal, ship time in the port, the number of ships processed and the number of containers handled are considered. The simulation result are as follows. 1) no difference among 3 ship dispatching rules, 2) berth allocation rules depends on performance measures 3) dynamic crane allocation is better than fixed policy 4) pooling yard allocation is better than short distance yard allocation rules and 5) fixed yard truck allocation by berth is a little better than pooling policy.

• 한국항만경제학회지
• /
• 제18권1호
• /
• pp.27-41
• /
• 2002

This paper deals with the development of a simulation model for the container terminal, which consists of 3 berths, 8 container cranes, and 16 yard blocks with each yard crane and 90 yard trucks in order to evaluate the various operational rules. The proposed operational rules are 3 ship-dispatching rules, 3 berth allocation rules, 2 crane allocation rules, 2 yard allocation rules, and 2 yard truck allocation rules. These rules are simulated using 4 performance measures, such as ship time in the terminal, ship time in the port, the number of ships processed, and the number of containers handled. The simulation result is as follows: 1) there is no difference among 3 ship-dispatching rules, 2) berth allocation rules depend on performance measures, 3) dynamic crane allocation is better than fixed policy, 4) pooling yard allocation is better than short distance yard allocation rules, and 5) fixed yard truck allocation by berth is a little better than pooling policy.

• 산업경영시스템학회지
• /
• 제22권50호
• /
• pp.221-230
• /
• 1999

The important issue for intra-city truck dispatching system is to measure and store actual travel speeds between customer locations. Travel speeds(and times) in nearly all metropolitan areas change drastically during the day because of congestion in certain parts of the city road network. We propose a back-propagation neural network model to recognize the pattern of intra-city vehicle travel speeds between locations that relieve much burden for the data collection and computer storage requirements. On a real-world study using the travel speed data[1] collected in Seoul, we evaluate performance of neural network model and compare with Park & Song model[2] that employs the least square method.