• 제목/요약/키워드: Vehicle Scheduling Models

검색결과 12건 처리시간 0.024초

How Customer Adaptability Factors Affect Information Systems for Transportation: Vehicle Scheduling Models with Time Flexibility

  • Soonhui Lee
    • Asia pacific journal of information systems
    • /
    • 제27권1호
    • /
    • pp.1-17
    • /
    • 2017
  • The need for effective information systems that can help in efficient transportation management has become essential. This study presents the potential benefits of developing a decision support system used by a trucking company for routing and scheduling. Our study investigates how customer exibility factors affect the utilization of transportation resources and establishes a vehicle scheduling model for better allocation of transportation resources with a time window. The results show vehicle savings from 25% up to 70% per day given different levels of exibility in delivery times. Increased capacity utilization can be achieved by considering only customer exibility in the model. Our study implies that incorporating customer exibility into the information system can help transportation organizations have the capability to gain control over management to cut costs and improve service.

Multiobjective Genetic Algorithm for Scheduling Problems in Manufacturing Systems

  • Gen, Mitsuo;Lin, Lin
    • Industrial Engineering and Management Systems
    • /
    • 제11권4호
    • /
    • pp.310-330
    • /
    • 2012
  • Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.

차량일정계획을 위한 도시내 차량이동속도 추정모델에 대한 연구 (A Study on the Estimation Models of Intra-City Travel Speeds for Vehicle Scheduling)

  • 박양병;홍성철
    • 산업공학
    • /
    • 제11권1호
    • /
    • pp.75-84
    • /
    • 1998
  • The important issue for intra-city vehicle scheduling is to measure and store actual vehicle 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 three models for estimating departure time-dependent travel speeds between locations that relieve much burden for the data collection and computer storage requirements. Two of the three models use a least squares method and the rest one employs a neural network trained with the back-propagation rule. On a real-world study using the travel speed data collected in Seoul, we found out that the neural network model is more accurate than the other two models.

  • PDF

일반거리산정방법을 이용한 다-물류센터의 최적 수송경로 계획 모델 (A Vehicle Routing Model for Multi-Supply Centers Based on Lp-Distance)

  • 황흥석
    • 산업공학
    • /
    • 제11권1호
    • /
    • pp.85-95
    • /
    • 1998
  • This study is focussed on an optimal vehicle routing model for multi-supply centers in two-echelon logistic system. The aim of this study is to deliver goods for demand sites with optimal decision. This study investigated an integrated model using step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations such as the capability of supply centers, vehicle capacity and transportation parameters. Three sub-models are developed: 1) sector-clustering model, 2) a vehicle-routing model based on clustering and a heuristic algorithm, and 3) a vehicle route scheduling model using TSP-solver based on genetic and branch-and-bound algorithm. Also, we have developed computer programs for each sub-models and user interface with visualization for major inputs and outputs. The application and superior performance of the proposed model are demonstrated by several sample runs for the inventory-allocation and vehicle routing problems.

  • PDF

A New Ship Scheduling Set Packing Model Considering Limited Risk

  • Kim, Si-Hwa;Hwang, Hee-Su
    • 한국항해항만학회지
    • /
    • 제30권7호
    • /
    • pp.561-566
    • /
    • 2006
  • In this paper, we propose a new ship scheduling set packing model considering limited risk or variance. The set packing model is used in many applications, such as vehicle routing, crew scheduling, ship scheduling, cutting stock and so on. As long as the ship scheduling is concerned, there exits many unknown external factors such as machine breakdown, climate change and transportation cost fluctuation. However, existing ship scheduling models have not considered those factors apparently. We use a quadratic set packing model to limit the variance of expected cost of ship scheduling problems under stochastic spot rates. Set problems are NP-complete, and additional quadratic constraint makes the problems much harder. We implement Kelley's cutting plane method to replace the hard quadratic constraint by many linear constrains and use branch-and-bound algorithm to get the optimal integral solution. Some meaningful computational results and comments are provided.

수송경로 문제를 고려한 물류최적화모델의 연구 (A supply planning model based on inventory-allocation and vehicle routing problem with location-assignment)

  • 황흥석;최철훈;박태원
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
    • /
    • pp.201-204
    • /
    • 1997
  • This study is focussed on optimization problems which require allocating the restricted inventory to demand points and assignment of vehicles to routes in order to deliver goods for demand sites with optimal decision. This study investigated an integrated model using three step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations. we developed several sub-models such as; first, an inventory-allocation model, second a vehicle-routing model based on clustering and a heuristic algorithms, and last a vehicle routing scheduling model, a TSP-solver, based on genetic algorithm. Also, for each sub-models we have developed computer programs and by a sample run it was known that the proposed model to be a very acceptable model for the inventory-allocation and vehicle routing problems.

  • PDF

공급사슬환경하에서 차량의 도착시각 시간창 결정을 위한 모델 (A Model for Determining Time Windows for Vehicles of Suppliers in a Supply Chain)

  • 김기영;김갑환
    • 산업공학
    • /
    • 제14권4호
    • /
    • pp.365-373
    • /
    • 2001
  • It is discussed how to determine time windows for pickups and deliveries, which have been assumed to be given in all most of previous studies on traveling salesman problems with time window, vehicle routing problems with time window, vehicle scheduling and dispatching problems, and so on. First, time windows are classified into four models (DR, DA, AR, and AA) by customers‘ polices. For each model, it is shown how a time window is related to various cost terms of suppliers and customers. Under the assumption of collaborative supplier-customer relationship, an integrated cost model for both supplier and customer is constructed for determining boundaries of time windows. The cost models in this paper consists of cost terms that depend on waiting time, early arrival time, late arrival time, and rejection of receipt. A numerical example is provided and results of the sensitivity analysis for some parameters are also provided to help intuitive understanding about the characteristics of the suggested models.

  • PDF

CVO 환경을 고려한 차량 및 화물 운송 최적 모델 (Freight and Fleet Optimization Models under CVO Environment)

  • 최경현;편제범;곽호만
    • 한국산업경영시스템학회:학술대회논문집
    • /
    • 한국산업경영시스템학회 2002년도 춘계학술대회
    • /
    • pp.209-215
    • /
    • 2002
  • In this paper, we propose a freight and fleet optimization model under CVO environment. The model is a kind of multi commodity network flow model based on Vehicle Routing Problem(VRP) and Vehicle Scheduling Problem(VSP), and considering operations and purposes of CVO. The main purpose of CVO is the freight and fleet management to reduce logistics cost and to Improve in vehicle safety. Thus, the objective of this model is to minimize routing cost of all the vehicle and to find the location of commodities which have origin and destination. We also present some computing test results.

  • PDF

시간제약과 하역장 용량제약이 있는 차량경로문제에 대한 타부탐색 알고리즘 (A Tabu Search Algorithm for the Vehicle Routing Problem with Time Window and Dock Capacity Constraints)

  • 장희정;이경식;최은정;박성수
    • 한국경영과학회지
    • /
    • 제30권4호
    • /
    • pp.45-60
    • /
    • 2005
  • We consider a vehicle routing problem with time window and dock capacity constraints (VRPTD). In most traditional models of vehicle routing problems with time window (VRPTW), each customer must be assigned to only one vehicle route. However demand of a customer may exceed the capacity of one vehicle, hence at least two vehicles may need to visit the customer We assume that each customer has Its own dock capacity. Hence, the customer can be served by only a limited number of vehicles simultaneously. Given a depot, customers, their demands, their time windows and dock capacities, VRPTD is to get a set of feasible routes which pass the depot and some customers such that all demands of each customer are satisfied Since VRPTD is NP-hard, a meta-heuristic algorithm is developed. The algorithm consists of two Procedures : the route construction procedure and the route scheduling procedure. We tested the algorithm on a number of instances and computational results are reported.

ESS 가치평가 기반 PV-ESS 연계 EV 충전스테이션 사업 타당성 분석 (Economic Feasibility Analysis of Electrical Vehicle Charging Station Connected with PV & ESS based on ESS Valuation)

  • 이지현;제갈성;정용찬;윤아윤
    • Current Photovoltaic Research
    • /
    • 제11권4호
    • /
    • pp.124-133
    • /
    • 2023
  • In order to deploy the large-scale energy storage (ES) service in the various industry, it is very important to develop a business model with high technological and economic feasibility through detailed valuation of cost and expected benefits. In relation to this, this paper established an optimal scheduling plan for electric vehicle charging stations connected with photovoltaic (PV) and ES technologies in Korea using the distributed energy resource valuation tool and analyzed the feasibility of the project. In addition, the impact of incentives such as REC (Renewable Energy Certificate) to be given to electric vehicle charging stations in accordance with the relevant laws to be revised in the future was analyzed. As a results, the methodology presented in this paper are expected to be used in various ways to analyze the feasibility of various business models linked to renewable energy and ES technologies as well as the electric vehicle market.