• Title/Summary/Keyword: Optimal route selection

Search Result 52, Processing Time 0.031 seconds

Acoustic Signal based Optimal Route Selection Problem: Performance Comparison of Multi-Attribute Decision Making methods

  • Borkar, Prashant;Sarode, M.V.;Malik, L. G.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.647-669
    • /
    • 2016
  • Multiple attribute for decision making including user preference will increase the complexity of route selection process. Various approaches have been proposed to solve the optimal route selection problem. In this paper, multi attribute decision making (MADM) algorithms such as Simple Additive Weighting (SAW), Weighted Product Method (WPM), Analytic Hierarchy Process (AHP) method and Total Order Preference by Similarity to the Ideal Solution (TOPSIS) methods have been proposed for acoustic signature based optimal route selection to facilitate user with better quality of service. The traffic density state conditions (very low, low, below medium, medium, above medium, high and very high) on the road segment is the occurrence and mixture weightings of traffic noise signals (Tyre, Engine, Air Turbulence, Exhaust, and Honks etc) is considered as one of the attribute in decision making process. The short-term spectral envelope features of the cumulative acoustic signals are extracted using Mel-Frequency Cepstral Coefficients (MFCC) and Adaptive Neuro-Fuzzy Classifier (ANFC) is used to model seven traffic density states. Simple point method and AHP has been used for calculation of weights of decision parameters. Numerical results show that WPM, AHP and TOPSIS provide similar performance.

A Study on Bicycle Route Selection Using Optimal Path Search (최적 경로 탐색을 이용한 자전거 경로 선정에 관한 연구)

  • Baik, Seung Heon;Han, Dong Yeob
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.5
    • /
    • pp.425-433
    • /
    • 2012
  • Dijkstra's algorithm is one of well-known methods to find shortest paths over a network. However, more research on $A^*$ algorithm is necessary to discover the shortest route to a goal point with the heuristic information rather than Dijkstra's algorithm which aims to find a path considering only the shortest distance to any point for an optimal path search. Therefore, in this paper, we compared Dijkstra's algorithm and $A^*$ algorithm for bicycle route selection. For this purpose, the horizontal distance according to slope angle and average speed were calculated based on factors which influence bicycle route selection. And bicycle routes were selected considering the shortest distance or time-dependent shortest path using Dijkstra's or $A^*$ algorithm. The result indicated that the $A^*$ algorithm performs faster than Dijkstra's algorithm on processing time in large study areas. For the future, optimal path selection algorithm can be used for bicycle route plan or a real-time mobile services.

Route Selection in a Dynamic Multi-Agent Multilayer Electronic Supply Network

  • Mahdavi, Iraj;Fazlollahtabar, Hamed;Shafieian, S. Hosna;Mahdavi-Amiri, Nezam
    • Journal of Information Technology Applications and Management
    • /
    • v.17 no.1
    • /
    • pp.141-155
    • /
    • 2010
  • We develop an intelligent information system in a multilayer electronic supply chain network. Using the internet for supply chain management (SCM) is a key interest for contemporary managers and researchers. It has been realized that the internet can facilitate SCM by making real time information available and enabling collaboration between trading partners. Here, we propose a multi-agent system to analyze the performance of the elements of a supply network based on the attributes of the information flow. Each layer consists of elements which are differentiated by their performance throughout the supply network. The proposed agents measure and record the performance flow of elements considering their web interactions for a dynamic route selection. A dynamic programming approach is applied to determine the optimal route for a customer in the end-user layer.

  • PDF

Job Route Selection Model for Line Balancing of Flexible PCB Auto-Insertion Line (유연 PCB 자동삽입라인의 부하 평준화를 위한 작업흐름선택모델)

  • Ham, Ho-Sang;Kim, Young-Hui;Chang, Yun-Koo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.4
    • /
    • pp.5-21
    • /
    • 1994
  • We have described the optimal process route selection model for the PCB(printed circuit board) auto-insertion line. This PCB assembly line is known as a FFL(flexible flow line) which produces a range of products keeping the flow shop properties. Under FFL environments, we have emphasized the balancing of work-loads in order to maximize total productivity of PCB auto-insertion line. So we have developed a heuristic algorithm based on a work-order selection rule and min-max concept for the job route selection model.

  • PDF

Optimization Analysis of Flexible Cellular Manufacturing: Route Selection and Determining the Optimal Production Conditions for Ordered Products (유연한 셀생산을 위한 최적가공경로와 생산조건의 결정)

  • Song, Sang-Jae;Choi, Jung-Hee
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.18 no.1
    • /
    • pp.47-62
    • /
    • 1992
  • This paper describes a procedure for optimizing the route selection and production conditions in alternate process plans under a cellular manufacturing environment. The type of production is mainly production-to-order which deals with unexpected products as the changes factor. The flexible cellular manufacturing can be viewed as a complete unification of both flexible manufacturing process and flexible production management. The integrated problem for designing flexible cellular manufacturing associated with determining the optimal values of the machining speeds, overtime, and intercell flow is formulated as Nonlinear Mixed Integer Programming(NMIP) in order to minimize total production change cost. This is achieved by introducing the marginal cost analysis into the NMIP, which will compute the optimal machining speed, overtime, intercell flow, and routing. The application of this procedure offers greater flexibility to take advantage of the cellular manufacturing due to the optimum use of resources. A solution procedure for this problem was developed and a numerical example is included.

  • PDF

Machining Route Selection and Determination of Input Quantity with Yield Using Genetic Algorithm (장비 수율을 고려한 가공경로선정과 투입량 결정에서의 유전알고리즘 접근)

  • Lee Kyuyong
    • Proceedings of the Society of Korea Industrial and System Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.99-104
    • /
    • 2002
  • This paper addresses a problem of machining route selection and determination of input quantity with yield in multi-stage flexible flow system. The problem is formulated as nonlinear programing and the proposed model is solved by genetic algorithm(GA) approach. The effectiveness of the proposed GA approach is evaluated through comparisons with the optimal solution obtained from the branch and bound for the same problem.

  • PDF

Improvement of NIMBY Facilities Route Planning Considering Social Conflict (사회적 갈등을 고려한 비선호시설 노선 선정 개선 연구)

  • Choi, Younguk;Lee, Changjun;Han, Seung Heon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.38 no.3
    • /
    • pp.487-496
    • /
    • 2018
  • In route selection process of NIMBY facilities, many conflicts occur due to route selection procedure and NIMBY syndrome. Especially, the social conflicts surrounding the site selection and operation are frequent enough to account for 70% of the total conflict cases, causing significant losses. To resolve the conflict in route selection, social conflicts are considered. Therefore, this study proposes an improved process of selecting route considering social conflicts in the power transmission line. First, the analysis of previous research trends and interviews with experts revealed the improved exclusion zone criteria, the factors and priorities of NIMBY facilities. After selecting the candidate routes, the optimal route is selected by using Fuzzy-TOPSIS. Hence, 83.3% of six experts have verified that this model minimizes conflicts and has sufficient applicability. The proposed model is expected to be used as a tool to minimize social conflict in the selection process of the power transmission line in the early stage of the project.

Development of VE/LCC Evaluation Model for Railway Route Selection (최적 철도 노선 선정을 위한 VE/LCC 평가 모델 개발)

  • 이동욱;이태식
    • Journal of the Korean Society for Railway
    • /
    • v.7 no.3
    • /
    • pp.215-222
    • /
    • 2004
  • Optimal route selection of railway should take consideration of the function of the railway, topography, practicability of construction and management as well as the cost. This study performed the surveys for experts and surrounding industries and the review for the bid guidelines in order to develop the quality model with the AHP method and establish the weight for each factor. Six quality models were developed for such as the efficiency of railway operation, structure design and practicability, economic feasibility, correspondence with other plans, civil appeal and environmental sustainability, and correspondence with system. The detailed evaluation elements were also derived by each factors.

Job Route Selection Expert System for Workload Balancing in Flexible Flow Line (유연생산라인의 부하평준화를 위한 작업흐름선택 전문가시스템)

  • 함호상;한성배
    • Journal of Intelligence and Information Systems
    • /
    • v.2 no.1
    • /
    • pp.93-107
    • /
    • 1996
  • A flexible flow line(FFL) consists of several groups of identical machines. All work-orders flow along the same path through successive machine groups. Thus, we emphasized the balancing of workloads between machine groups in order to maximize total productivity. On the other hand, many different types of work-orders, in varying batch or lot sizes, are produced simultaneously. The mix of work-orders, their lot sizes, and the sequence in which they are produced affect the amount of workload. However, the work-orders and their lot sizes are prefixed and cannot be changed. Because of these reasons, we have developed an optimal route selection model using heuristic search and Min-Max algorithm for balancing the workload between machine groups in the FFL.

  • PDF

-Machining Route Selection with the Shop Flow Information Using Genetic Algorithm- (작업장 특성을 고려한 가공경로선정 문제의 유전알고리즘 접근)

  • 이규용;문치웅;김재균
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.54
    • /
    • pp.13-26
    • /
    • 2000
  • Machining route selection to produce parts should be based on shop flow information because of input data at scheduling tasks and is one of the main problem in process planning. This paper addresses the problem of machining route selection in multi-stage process with machine group included a similar function. The model proposed is formulated as 0-1 integer programing considering the relation of parts and machine table size, avaliable time of each machine for planning period, and delivery date. The objective of the model is to minimize the sum of processing, transportation, and setup time for all parts. Genetic algorithm approach is developed to solve this model. The efficiency of the approach is examined in comparison with the method of branch and bound technique for the same problem. Also, this paper is to solve large problem scale and provide it if the multiple machining routes are existed an optimal solution.

  • PDF