Ant Colony Optimization on Crowdsourced Delivery Trip Consolidation
|
|
- Pauline Richard
- 6 years ago
- Views:
Transcription
1 IJCCS, Vol.11, No.2, July 2017, pp. 109~118 ISSN: Ant Colony Optimization on Crowdsourced Delivery Trip Consolidation Victor Paskalathis* 1, Azhari SN. 2 1 Program Studi S2 Ilmu Komputer, FMIPA UGM, Yogyakarta, Indonesia 2 Jurusan Ilmu Komputer dan Elektronika, FMIPA UGM, Yogyakarta, Indonesia * 1 vic.easter@gmail.com, 2 arisn.softcomp@gmail.com 109 Abstrak Pengiriman barang berbasis urun daya umumnya dilakukan melalui pengiriman langsung, yakni dengan mengutus kurir terdekat dari lokasi asal. Jarak tempuh keseluruhan dapat dikurangi melalui pengambilan dan pengiriman jamak, yakni dengan memperbanyak jumlah permintaan yang dapat dipenuhi dalam satu perjalanan. Penelitian ini mengimplementasikan algoritma eksak untuk menyelesaikan masalah konsolidasi hingga tiga permintaan dalam satu perjalanan. Algoritma serakah digunakan untuk menyusun rute awal berdasarkan penghematan jarak tertinggi. Hasilnya kemudian dioptimasi menggunakan algoritma semut. Dalam penelitian ini empat skenario dibandingkan, yakni skenario pengiriman langsung dan tiga skenario pengambilan dan pengiriman jamak. Skenario ini mencakup konsolidasi dua pengiriman, tiga pengiriman dan tiga pengiriman yang dioptimasi menggunakan algoritma semut. Empat parameter digunakan untuk mengevaluasi tiap skenario menggunakan analisis hirarki proses (AHP). Parameter tersebut adalah jumlah perjalanan, jarak tempuh total, waktu tempuh total dan pertimbangan keamanan. Studi kasus yang digunakan adalah wilayah operasional Yogyakarta selama sehari penuh. Rute pengiriman yang dioptimasi menggunakan algoritma semut menunjukkan bahwa 178 permintaan dapat dipenuhi dalam 94 perjalanan. Rute ini juga memberikan penghematan jarak tempuh sebesar 20% dan waktu tempuh sebesar 15%. Hasil evaluasi menggunakan AHP menunjukkan skenario algoritma semut sebagai skenario terbaik.. Kata kunci algoritma semut, masalah pengambilan dan pengiriman, penghematan tertinggi, urun daya, konsolidasi perjalanan Abstract Common practice in crowdsourced delivery services is through direct delivery. That is by dispatching direct trip to a driver nearby the origin location. The total distance can be reduced through multiple pickup and delivery by increasing the number of requests in a trip. The research implements exact algorithm to solve the consolidation problem with up to 3 requests in a trip. Greedy heuristic is performed to construct initial route based on highest savings. The result is then optimized using Ant Colony Optimization (ACO). Four scenarios are compared. A direct delivery scenarios and three multiple pickup and delivery scenarios. These include 2-consolidated delivery, 3-consolidated delivery, and 3-consolidated delivery optimized with ACO. Four parameters are used to evaluate using Analytical Hierarchical Process (AHP). These include the number of trips, total distance, total duration, and security concerns. The case study is based on Yogyakarta area for a whole day. The final route optimized with ACO shows 178 requests can be completed in 94 trips. Compared to direct delivery, consolidation can provides savings up to 20% in distance and 14% in duration. The evaluation result using AHP shows that ACO scenario is the best scenario. Keywords Ant Colony Optimization, Pickup and Delivery Problem, highest savings, crowdsourced, trip consolidation Received November 23 th,2016; Revised March 21 th, 2017; Accepted March 22 th, 2017
2 110 ISSN: D 1. INTRODUCTION elivery performance can be evaluated by its effectiveness and efficiency. Effectiveness can be illustrated through direct delivery. This is the current practice of crowdsourced delivery services [1]. Delivery is done point to point, from an origin to a destination and this is done directly. In this scenario, the goods can reach the destination fastest in a single case. There is an issue in this method. Sometimes there is another request nearby or along the route which cannot be accepted since the driver already took the request. Another problem may also occur in collection or distribution case, where the request is to collect goods from multiple different origins and deliver to a single origin or vice versa. The above condition can be anticipated with multiple pickup and delivery or also known as consolidated delivery [2]. In this scenario, the efficiency can be maximized. Delivery is done by consolidating requests in the same direction so the vehicle capacity can be better utilized. This will also reduce the overall mileage, time on the road, and numbers of trip generated. The outcomes are lower carbon emission, traffic generation, and reduced travel cost. A simple static instance is shown in Fig. 1 The multiple pickup and delivery can provide 25% distance savings and 30% duration savings while still maintaining 1-hour guaranteed delivery. This is done with only 2 drivers compared to 5 drivers using direct delivery. By increasing the number of requests in a trip, the distance savings can be maximized. This is quite an opportunity. Current conventional courier services are using next-day delivery and same-day courier costs more expensive than crowdsourced delivery services. Figure 1 Problem illustration (left) and solution using multiple pickup and delivery (top right) and direct delivery (bottom right) Problems in transporting goods on delivery services can be described as Pickup and Delivery Problem (PDP), a constrained version of Traveling Salesman Problem (TSP). The problems are NP-Hard in nature [3] and two classes of algorithms are available for the solution: exact and approximate algorithms [4]. Exact algorithm guaranteed to find the optimal solution, however, in the worst case it requires exponential time to find the optimum. As the problem size increase, it quickly becomes unfeasible. Approximate algorithms seek to obtain high-quality solutions at relatively low computational cost without being able to guarantee the optimality of solutions. One of the modern approaches is by using metaheuristics, such as Ant Colony Optimization. Ant Colony Optimization is a population-based metaheuristic for the approximate solution of difficult optimization problems which inspired by ant foraging behavior [5]. Their way of foraging enables ants to find shortest paths between food sources and their nest. Initially, ants explore the area surrounding their nest randomly. As soon as an ant finds a source of food, IJCCS Vol. 11, No. 2, July 2017 :
3 IJCCS ISSN: it evaluates quantity and quality of the food and carries some of this food to the nest. During the return trip, the ant lays chemical pheromone trail on the ground. The quantity of pheromone deposited will guide other ants to the food source. The problem to be solved in this research is to optimize current crowdsourced delivery practice by providing additional scenarios in delivery scheme. Several multiple pickup and delivery scenarios are developed to be compared with current direct delivery. The system is required to consolidate multiple requests into a trip, construct a route consists of trips to fulfill all requests, and provide the best scenario to consider. Three objectives are presented. The first objective is to develop several scenarios in crowdsourced delivery services based on multiple pickup and delivery. The second objective is to implement Ant Colony Optimization in route optimization. The last objective is to evaluate the scenario using Analytical Hierarchical Process and provide the best scenario to consider. Study on pickup and delivery problem (PDP) has been done since decades ago, as it represents the general transportation problem with precedence constraint in term of origin and destination. One of the earliest studies of PDP was conducted by [6] in solving single and multiple vehicle PDP using various exact and heuristic algorithms. The most general PDP is constrained by capacity, time windows, quality of service, operational considerations and the precedence requirement. Presented metaheuristic solution of PDP with time windows for city courier [7]. The research addresses both online and offline requests in the form of PDP and dynamic PDP with time windows. Dynamic PDP can be seen as a static problem which occurs sequentially. Using 2-stage algorithms, the research implements Insertion Heuristic for tour construction and improved by Tabu Search. The route update is carried on the dynamic problem when a new request arrives. Early research in PDP using Ant Colony Optimization (ACO) presented by [8] to optimize the total costs associated with the pickup and delivery of full truckloads under time window constraints in a hub network. A thorough technical analysis of the ACO was done by comparing different pheromone decoding schemes, different visibility information, and various population sizes. The study also proposes a post-optimization technique to improve the solutions. The results show that appropriate data structures significantly improve the solution quality. Compares Improved Ant Colony System (I-ACS) algorithm towards Nearest Neighbor, Nearest Neighbor + Insertion on both dynamic and static VRP and PDP problem on city and inter-city courier [9][10]. Node insertion was used to determine route and number of appropriate vehicle on dynamic PDP. Shortest path calculated using Dijkstra since the distance uses actual city road data. Analytical Hierarchical Process (AHP) [11] implemented in this research to evaluate the scenarios since it is easy to perform and based on pairwise comparisons to maintain consistency of each pairwise values. [12] have successfully implement AHP to compare results from various VRP algorithm. 2. RESEARCH METHOD 2.1 Model Formulation The objective function in this research is to maximize the distance savings. The distance savings are the difference between sum of direct trip of each request and total distance of consolidated trip. Subject to: 1. Flow constraint, ensures a request only assigned to one vehicle. 2. Flow conservation, ensures a vehicle only enters or leaves a location l if it is an origin or a destination of a transport request assigned to that vehicle. 3. Consolidation limit constraint, ensures that a vehicle only assigned to a maximum n number of requests in a trip. Ant Colony Optimization on Crowdsourced Delivery Trip.. (Victor Paskalathis)
4 112 ISSN: Schedule compatibility, serves as preliminary check for maximum time range between requests before driver is dispatched. 5. Pairing constraint, ensures that both origin and destination of a request must be served by the same vehicle. 6. Precedence constraint, ensures each pickup location visited before the delivery location. 7. Chaining constraint, disallows direct trip at the start or the end of the trip. request in consolidated trip shall not be independent, since direct trip has no increase in distance savings. Such trip should be split. 8. Savings constraint, ensures the consolidated trip will provide positive distance savings. Distance of consolidated trip must be equal or lesser than sum of direct trip of each request. 9. Time windows and service time constraint, serve as quality of service constraint. The maximum service time for pickup and time windows for delivery is 1 hour and 3 hours since request created. 10. Best alternate constraint, if there are several trips serving same requests, the selected trip is the one which provide highest savings. Trip distance savings is the sum of all direct trip of each request minus the consolidated trip. 2.2 System Process Fig. 2 shows the system process. Raw datasets are preprocessed to produce distance and duration matrix off the system. Both data then used as inputs. The first step in the system tries to generate all possible route based on the constraint using the exact algorithm. The second step is to find a route with highest savings using greedy the algorithm. The results are used as Scenario 1, 2, 3 for direct, c=2 and c=3 respectively. Raw Dataset (Requests) Preprocessing Input Test Data (Locations) Distance & Duration Matrix Exact Trip Generator Scenario 1, 2, 3 Highest Savings Heuristic Scenario 4 ACO Evaluation AHP Recommendation Figure 2 System flowchart IJCCS Vol. 11, No. 2, July 2017 :
5 IJCCS ISSN: The third step uses the ACO [13] to optimize the result based on the previous attempt on c=3. The result is used as Scenario 4. The last step is the evaluation. This is done by implementing AHP method based on four parameters. The final output is the recommendation on which scenario is better to be implemented. 2.3 Exact Trip Generator The exact trip generator solves two of three problems in PDP; routing and scheduling. This is done through the exact algorithm by applying PDP constraint. The trip generated by static routing has total pickup based on consolidation or in c=3 scenario, it has either 2, 4, or maximum 6 stops. Trip with highest savings become the valid trip to serve unique requests. Fig. 3 shows the detailed process in this step. START Generate combination of requests Schedule Compatible? Data Sets Generate alternate trips from requests Positive Savings? Distance Matrix Set Latest Request Time as Starting Time END Has all combinations generated? Add Next Stop Update Time Duration Matrix Service Time/ Time Windows Compatible? Valid Trips Set trip with maximum savings as the valid trip Has all trips generated? Trip Complete? Figure 3 Exact Trip Generator The approach is quite similar with Clarke-Wright Savings Algorithm [14], with two key differences. The trip doesn t start from a depot, the trip also not required to return to the depot. In this case, there might be negative distance savings. Ant Colony Optimization on Crowdsourced Delivery Trip.. (Victor Paskalathis)
6 114 ISSN: Highest Savings Heuristic Highest savings heuristic construct a route which serves all of the requests. This is assignment problem, through finding the combination of previously generated trips which has highest savings to serve all requests. Fig. 4 describe the process in the current step. The system utilizes greedy algorithm based on highest savings. The approach is similar to nearest neighbor, instead of shortest distance, largest distance savings used. The valid trips sorted in descending based on savings. The trip with largest savings is assigned to route until there s no more valid consolidation left. The remaining requests are fulfilled with direct delivery. START Set all request as available END Valid trips Select trip with maximum savings as part of the route Has all request been served? Highest Savings Route Remove all requests within selected trip from available Figure 4 Highest savings Remove all valid trips containing the requests of selected trip 2.5 Ant Colony Optimization The optimization process based on ACO can be seen in Fig. 5. This can be divided into 3 main stages. First is the initialization of parameter, followed by solution construction, and pheromone updates and local optimization. After the maximum iterations, it returns the bestfound route. This research is using ACO variant known as Ant Colony System (ACS) [15]. Highest Savings Route Valid Trips START ACO Set as best route Parameter Initialization (β,q0,τ0,ξ,ρ,φ) Pheromone Initialization STOP ACO Calculate P probability of available trips. Roll random q Start with empty route Set all requests as available Have the maximum iterations been performed? Exploit Trip=argmax(P) q < q0 Have all requests been assigned? Select the trip. Set requests within trip as completed Explore Trip=random(P) Update local pheromone Evaporation and deposition (route trips) New route > best route Set new route as best route Have all ants completed the route? Update global pheromone Evaporation (All trips) Deposition (best trips) Figure 5 Ant Colony Optimization IJCCS Vol. 11, No. 2, July 2017 :
7 IJCCS ISSN: The research modifies several factors from standard ACS: 1. where s ls is the savings generated from highest savings heuristic and n the number of trips. Required to accommodate savings maximization 2. is also required to accommodate savings maximization. 3. φ phi parameter in pheromone initialization, with φ = (0, 1). This parameter is useful to prevent the optimization stuck on local optima. The downside is that it will take more loops to find better results. 2.6 AHP Evaluation This research doesn t end with the best route, but also a recommendation towards the business development plan. This is completed using AHP with overall performance as the goal. The basic structure of a decision problem is a hierarchy consisting of 3 levels. The goal of the decision at the top level. The second levels are parameters used. The third levels are alternatives to be evaluated. Fig. 6 shows the hierarchy. Overall Performance Parameter Number of Trips Total Distance Total Duration Safety Concerns [2-4] Alternatives Direct Delivery Consolidated Delivery (c=2) Consolidated delivery (c=3) Consolidated delivery with ACO (aco) Figure 6 AHP Hierarchy Parameter weights Pairwise value for each parameter weight are used, ranging from Since there are equal parameters and scenarios used, which is 4, then Random Index in use is 0.9. The result of the weight can be seen in Table 1. The CR value is which is below 0.1. Based on the EV, the parameter which has the highest weight is the number of trips, followed by total distance and security concerns, with total duration least considered. Table 1 Weight EV Weight Trip distance Duration Security Ev Trip Distance Duration Security Ant Colony Optimization on Crowdsourced Delivery Trip.. (Victor Paskalathis)
8 116 ISSN: Scenario rating Rating method for each scenario based on parameters are shown below: 1. Number of Trips: to be reduced, lower value preferred. 2. Total distance: to be reduced, lower value preferred. 3. Total duration: to be reduced, lower value preferred. 4. Security concerns: implemented with scoring from 2-4 with higher value preferred as below: 1) direct score=4 2) c=2 score=3 3) c=3, aco score=2 3. RESULT AND DISCUSSION Table 2 shows an overview of each scenario result. In general, increase in the number of consolidation yields reduction in the number of trips, total distance, and total duration. Savings value is compared with direct data. Aco is used to compare since it provides highest savings. Table 2 Summary of figures direct c=2 c=3 Aco Trips Direct Trips Distance 1,309,800 1,091,971 1,056,102 1,050,761 Distance savings 0 217, , ,039 Duration 200, , , ,984 Duration savings 0 20,081 26,607 27,213 Overall the routing results show promising savings can be done by implementing multiple pickup and delivery. The number of trips reduced from 178 to 94 which is 47% reduction. The total distance is reduced by 20% and duration is reduced by 14%. The consolidation still leaves several trips to be completed with direct delivery, or 42% in aco scenario. There are also 6 trips that have no valid consolidation and completed with this method. Fig. 7 shows the number of trips each hour between scenarios. In peak hour between 15:00 to 15:59, the consolidation able to reduce the number of trips more than 50% number of trips. This shows that the higher number of requests per hour, the higher chance of requests can be consolidated. Figure 7 Trip per hour IJCCS Vol. 11, No. 2, July 2017 :
9 IJCCS ISSN: Fig. 8 shows how the ACO iterations producing distance savings result. The best route occurs in 5 th iteration 10 th ant with 259,039 distance savings. Figure 8 ACO iterations Table 3 shows final AHP results. The best scenario is the ACO scenario, with slight difference to c=2 scenario. Higher consolidation with proper optimization provides a better result with downside on the security issue. In a broader scope, consolidated delivery result in better score compared to instant delivery. Table 3 AHP ranks Delivery Trip distance duration Security Score rank Weight direct c= c= aco CONCLUSION Based on the research, there are several things to be concluded: 1. The research has successfully developed 4 scenarios to be compared. The direct delivery, 2-consolidated delivery, 3-consolidated delivery and 3-consolidated delivery optimized with ACO. 2. The research has successfully optimized the route using ACO. It shows improvements in considerable time from heuristic highest savings. It also shows that ACO able to work combined with both exact and heuristic algorithm to produce a satisfactory result. 3. The research has evaluated all scenarios using AHP. Using 4 parameters, the scenario with the highest score is 3-consolidated delivery optimized with ACO and therefore recommended to be implemented. 4. Overall the multiple pickup and delivery result is quite promising. 3-consolidated delivery optimized with ACO results in 20% distance reduction and 14% duration reduction compared to direct delivery. Ant Colony Optimization on Crowdsourced Delivery Trip.. (Victor Paskalathis)
10 118 ISSN: FUTURE WORKS There are several suggestions can be given from this research: 1. Larger problem size, the number of request in Yogyakarta Area is quite small compared to Jakarta. The algorithm should be able to handle at least thousands of requests. 2. Dynamic routing can be developed to compare with current static routing. It may be implemented in the main system to allows dynamic consolidation in real time and handle cancellation. 3. Parallelization through multicore/multiprocessing by running each ant in parallel instead of the current sequential system to decrease running time. REFERENCES [1] USPS OIG, 2014, Using the 'Crowd' to Deliver Packages, USPS OIG, Arlington. [2] Berling, P., & Eng-Larson, F., 2016, Pricing and Timing of Consolidated Deliveries in Presence of an Express Alternative - Financial and Environmental Analysis, European Journal of Operational Research, 250(2), pp [3] Savelsbergh, M.W.P, Sol, M., 1995, The General Pickup and Delivery Problem, Transport Sci, 29, pp [4] Toth, P., & Vigo, D., 2002, The Vehicle Routing Problem, Society for Industrial and Applied Mathematics, Philadelphia. [5] Blum, C. and Roli, A., 2008, Hybrid Metaheuristics: An Introduction, Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds.): Hybrid Metaheuristics: An Emerging Approach to Optimization, Springer-Verlag, Berlin. [6] Armstrong, G.R., 1981, The Single and Multiple Vehicle Pickup and Delivery Problem: Exact and Heuristic Algorithms, University of Tennessee, Knoxville. [7] Rani, F. K., 2008, Pengembangan Algoritma Heuristik untuk Penyelesaian Dynamic Pick Up and Delivery Problem with Time Windows (DPDTW) Pada Penyedia Jasa City Courier, Skripsi, Fakultas Teknik Industri ITS, Surabaya. [8] Doerner, K., Hartl, R., Reimann, M., 2000, Ant colony optimization applied to the pickup and delivery problem, SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, Vienna. [9] Firmansyah, A., 2011, Algoritma Improved Ant Colony System untuk Menyelesaikan Dynamic Pick-Up and Delivery Problem with Time Windows Pada Penyedia Layanan Kurir Dalam Kota, Skripsi, Fakultas Teknik Industri ITS, Surabaya. [10] Gamayanti, N., 2009, Pengembangan Algoritma Heuristik Ant Colony System untuk Permasalahan Dynamic Vehicle Routing Problem dengan Time Window (DVRPTW) pada Proses Konsolidasi Penyedia Jasa Inter-City Courier, Thesis, Fakultas Teknik Industri ITS, Surabaya. [11] Saaty, T.L., & Vargas, L.G., 2012, Models, Methods, Concepts & Applications of the Analytic Hierarchy Process, 2 nd ed. Springer, New York. [12] Cavar, I., Gold, H., & Caric, T., 2005, Assessment of Heuristic Algorithms for Solving Real Capacitated Vehicle Routing Problems by Analytic Hierarchy Process, Transportation Research Board, San Francisco. [13] Dorigo, M., & Stützle, T., 2004, Ant Colony Optimization, MIT Press, Cambridge. [14] Clarke, G. & Wright, J., 1964, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operation Research, Vol. 12, pp [15] Dorigo, M., & Gambardella, L., 1997, Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Transactions on Evolutionary Computation, 1(1), pp IJCCS Vol. 11, No. 2, July 2017 :
Solution to a Multi Depot Vehicle Routing Problem Using K-means Algorithm, Clarke and Wright Algorithm and Ant Colony Optimization
Solution to a Multi Depot Vehicle Routing Problem Using K-means Algorithm, Clarke and Wright Algorithm and Ant Colony Optimization Pranavi Singanamala 1, Dr.K. Dharma Reddy, Dr.P.Venkataramaiah 3 1 M.Tech,
More informationAPPLICATION SOFTWARE DESIGN FOR OPTIMIZATION CABLE INSTALLATION WITH ANT COONY METHOD
APPLICATION SOFTWARE DESIGN FOR OPTIMIZATION CABLE INSTALLATION WITH ANT COONY METHOD Joni Cukri Binus University, Jalan KH. Syahdan No. 9 Palmerah, Jakarta 11480, Indonesia joni.cukri@yahoo.co.id ABSTRACT
More informationAnt Colony Optimisation
Ant Colony Optimisation Alexander Mathews, Angeline Honggowarsito & Perry Brown 1 Image Source: http://baynature.org/articles/the-ants-go-marching-one-by-one/ Contents Introduction to Ant Colony Optimisation
More informationUse of Genetic Algorithms in Discrete Optimalization Problems
Use of Genetic Algorithms in Discrete Optimalization Problems Alena Rybičková supervisor: Ing. Denisa Mocková PhD Faculty of Transportation Sciences Main goals: design of genetic algorithm for vehicle
More informationAnt Colony Optimization
Ant Colony Optimization Part 4: Algorithms Fall 2009 Instructor: Dr. Masoud Yaghini Ant Colony Optimization: Part 4 Outline The Traveling Salesman Problem ACO Algorithms for TSP Ant System (AS) Elitist
More informationHeuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny
Heuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia mifawzi@ksu.edu.sa Keywords:
More informationSolving VRP in an Indian Transportation Firm through Clark and Wright Algorithm: A Case Study
Solving VRP in an Indian Transportation Firm through Clark and Wright Algorithm: A Case Study Prateek Mittal, Nikhil Garg, Himank Ambashta, Charanjeev Mehndiratta Department of Mechanical Engineering,
More informationANT COLONY OPTIMIZATION FOR TOURIST ROUTE
ANT COLONY OPTIMIZATION FOR TOURIST ROUTE A thesis submitted to the Faculty of Information Technology in partial Fulfillment of the requirements Ifor the degree Master of Science (Information Technology)
More informationShort term strategies for a dynamic multi-period routing problem
Short term strategies for a dynamic multi-period routing problem E. Angelelli a, N. Bianchessi a, R. Mansini b, M.G. Speranza a a Dipartimento Metodi Quantitativi, University of Brescia, Italy b Dipartimento
More informationArtificial Intelligence Computational Techniques to Optimize a Multi Objective Oriented Distribution Operations
Proceedings of the 2010 International Conference on Industrial Engineering and Operations Management Dhaa, Bangladesh, January 9 10, 2010 Artificial Intelligence Computational Techniques to Optimize a
More informationAdvanced Metaheuristics. Daniele Vigo D.E.I. - Università di Bologna
Advanced Metaheuristics Daniele Vigo D.E.I. - Università di Bologna daniele.vigo@unibo.it Main families of Metaheuristics Single-solution methods Basic: Tabu Search, Simulated Annealing Advanced: Iterated
More informationA Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests
A Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests Pandhapon Sombuntham and Voratas Kachitvichayanukul Abstract A particle swarm optimization
More informationOnline Vehicle Routing: The Edge of Optimization in Large-Scale Applications
Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications Dimitris Bertsimas, Patrick Jaillet, Sébastien Martin Operations Research Center, Massachusetts Institute of Technology March
More informationDynamic Vehicle Routing and Dispatching
Dynamic Vehicle Routing and Dispatching Jean-Yves Potvin Département d informatique et recherche opérationnelle and Centre interuniversitaire de recherche sur les réseaux d entreprise, la logistique et
More informationDesign and Development of Enhanced Optimization Techniques based on Ant Colony Systems
IJIRST International Journal for Innovative Research in Science & Technology Volume 3 Issue 04 September 2016 ISSN (online): 2349-6010 Design and Development of Enhanced Optimization Techniques based on
More informationPro-active Dynamic Vehicle Routing
Francesco Ferrucci Pro-active Dynamic Vehicle Routing Real-Time Control and Request-Forecasting Approaches to Improve Customer Service Physica-Verlag A Springer Company Introduction 1 1.1 Motivation 3
More informationOPTIMIZATION OF A MULTI-OBJECTIVE-MULTI-PERIOD TRAVELING SALESMAN PROBLEM WITH PICKUP AND DELIVERY USING GENETIC ALGORITHM SEYED POURYA POURHEJAZY
OPTIMIZATION OF A MULTI-OBJECTIVE-MULTI-PERIOD TRAVELING SALESMAN PROBLEM WITH PICKUP AND DELIVERY USING GENETIC ALGORITHM SEYED POURYA POURHEJAZY A project report submitted in partial fulfilment of the
More informationMulti-depot Vehicle Routing Problem with Pickup and Delivery Requests
Multi-depot Vehicle Routing Problem with Pickup and Delivery Requests Pandhapon Sombuntham a and Voratas Kachitvichyanukul b ab Industrial and Manufacturing Engineering, Asian Institute of Technology,
More informationProcedia - Social and Behavioral Sciences 109 ( 2014 ) Selection and peer review under responsibility of Organizing Committee of BEM 2013.
Available online at www.sciencedirect.com ScienceDirect Procedia - Social and Behavioral Sciences 109 ( 2014 ) 779 783 2 nd World Conference On Business, Economics And Management-WCBEM 2013 A hybrid metaheuristic
More informationA Viral Systems Algorithm for the Traveling Salesman Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Viral Systems Algorithm for the Traveling Salesman Problem Dedy Suryadi,
More informationSimulation based layout design of large sized multi-row Flexible Manufacturing Systems
Journal of Engineering & Architecture 1(1); June 13 pp. 34-44 Srinivas et al. Simulation based layout design of large sized multi-row Flexible Manufacturing Systems Srinivas C Dept. of Mechanical Engineering
More informationAnt Systems of Optimization: Introduction and Review of Applications
International Journal of Electronics Engineering Research. ISSN 0975-6450 Volume 9, Number 2 (2017) pp. 275-279 Research India Publications http://www.ripublication.com Ant Systems of Optimization: Introduction
More informationOptimum Design of Water Conveyance System by Ant Colony Optimization Algorithms
Optimum Design of Water Conveyance System by Ant Colony Optimization Algorithms HABIBEH ABBASI, ABBAS AFSHAR, MOHAMMAD REZA JALALI Department of Civil Engineering Iran University of Science and Technology
More informationIMPLEMENTATION OF EFFECTIVE BED ALLOCATION AND JOB SCHEDULING IN HOSPITALS USING ANT COLONY OPTIMIZATION
IMPLEMENTATION OF EFFECTIVE BED ALLOCATION AND JOB SCHEDULING IN HOSPITALS USING ANT COLONY OPTIMIZATION N.Gopalakrishnan Department of Biomedical Engineering, SSN College of Engineering, Kalavakkam. Mail
More informationPresenting a New Ant Colony Optimization Algorithm (ACO) for Efficient Job Scheduling in Grid Environment
Presenting a New Ant Colony Optimization Algorithm (ACO) for Efficient Job Scheduling in Grid Environment Firoozeh Ghazipour Science and Research Branch Islamic Azad University, Kish, Iran Seyyed Javad
More informationDATA SCIENCE Journal of Computing and Applied Informatics
Journal of Computing and Applied Informatics (JoCAI) Vol. 02, No. 02, 208 87-00 DATA SCIENCE Journal of Computing and Applied Informatics Genetic Algorithms Dynamic Population Size with Cloning in Solving
More informationA new idea for train scheduling using ant colony optimization
Computers in Railways X 601 A new idea for train scheduling using ant colony optimization K. Ghoseiri School of Railway Engineering, Iran University of Science and Technology, Iran Abstract This paper
More informationWaiting Strategies for Regular and Emergency Patient Transportation
Waiting Strategies for Regular and Emergency Patient Transportation Guenter Kiechle 1, Karl F. Doerner 2, Michel Gendreau 3, and Richard F. Hartl 2 1 Vienna Technical University, Karlsplatz 13, 1040 Vienna,
More informationA DETERMINISTIC ANNEALING ALGORITHM FOR THE PRE- AND END-HAULAGE OF INTERMODAL CONTAINER TERMINALS
A DETERMINISTIC ANNEALING ALGORITHM FOR THE PRE- AND END-HAULAGE OF INTERMODAL CONTAINER TERMINALS An Caris Gerrit K. Janssens Transportation Research Institute Hasselt University - campus Diepenbeek Wetenschapspark
More informationAnt Colony Optimization
Ant Colony Optimization Part 2: Simple Ant Colony Optimization Fall 2009 Instructor: Dr. Masoud Yaghini Outline Ant Colony Optimization: Part 2 Simple Ant Colony Optimization (S-ACO) Experiments with S-ACO
More informationInsertion based Ants for Vehicle Routing Problems with Backhauls and Time Windows. Marc Reimann Karl Doerner Richard F. Hartl
Insertion based Ants for Vehicle Routing Problems with Backhauls and Time Windows Marc Reimann Karl Doerner Richard F. Hartl Report No. 68 June 2002 June 2002 SFB Adaptive Information Systems and Modelling
More informationA HEURISTIC FOR THE SOLUTION OF VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS AND MULTIPLE DUMPING SITES IN WASTE COLLECTION
A HEURISTIC FOR THE SOLUTION OF VEHICLE, University of Applied Sciences Merseburg, Germany 1 Problem statement 2 A cluster first route second approach 2.1 A capacitated k-means algorithm 2.2 A capacitated
More informationSolving Multi-Objective Multi-Constraint Optimization Problems using Hybrid Ants System and Tabu Search
MIC2003: The Fifth Metaheuristics International Conference HASTS-1 Solving Multi-Objective Multi-Constraint Optimization Problems using Hybrid Ants System and Tabu Search Hoong Chuin LAU, Min Kwang LIM,
More informationEvaluating Library Services Quality Using GDSS-AHP, LibQual, and IPA
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol.12, No.1, January 2018, pp. 95~106 ISSN (print): 1978-1520, ISSN (online): 2460-7258 DOI: 10.22146/ijccs.32142 95 Evaluating Library
More informationUniversité Libre de Bruxelles
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle An Experimental Study of Estimation-based Metaheuristics for the Probabilistic
More informationSolving the Vehicle Routing Problem with Multiple Multi-Capacity Vehicles
Solving the Vehicle Routing Problem with Multiple Multi-Capacity Vehicles Michael S. Sanders, Jr. Computer Systems Lab, 2008-2009 Thomas Jefferson High School for Science and Technology Alexandria, Virginia
More informationIncorporating Psychology Model of Emotion into Ant Colony Optimization Algorithm
12th WSEAS Int. Conf. on APPLIED MATHEMATICS Cairo Egypt December 29-31 2007 222 Incorporating Psychology Model of Emotion into Ant Colony Optimization Algorithm Jiann-Horng Lin Department of Information
More informationOptimization Using Simulation of the Vehicle Routing Problem
Optimization Using Simulation of the Vehicle Routing Problem Nayera E. El-Gharably, Khaled S. El-Kilany, and Aziz E. El-Sayed Abstract A key element of many distribution systems is the routing and scheduling
More informationA Study of Crossover Operators for Genetic Algorithms to Solve VRP and its Variants and New Sinusoidal Motion Crossover Operator
International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 7 (2017), pp. 1717-1733 Research India Publications http://www.ripublication.com A Study of Crossover Operators
More informationCover Page. Author: Zhiwei Yang Title: Meta-heuristics for vehicle routing and inventory routing problems Issue Date:
Cover Page The handle http://hdl.handle.net/1887/43073 holds various files of this Leiden University dissertation Author: Zhiwei Yang Title: Meta-heuristics for vehicle routing and inventory routing problems
More informationMetaheuristics. Approximate. Metaheuristics used for. Math programming LP, IP, NLP, DP. Heuristics
Metaheuristics Meta Greek word for upper level methods Heuristics Greek word heuriskein art of discovering new strategies to solve problems. Exact and Approximate methods Exact Math programming LP, IP,
More informationOptimizing the Construction Job Site Vehicle Scheduling Problem
sustainability Article Optimizing the Construction Job Site Vehicle Scheduling Problem Jaehyun Choi 1, Jia Xuelei 1 and WoonSeong Jeong 2, * ID 1 Department of Architectural Engineering, Korea University
More informationAn Approach for Solving Multiple Travelling Salesman Problem using Ant Colony Optimization
An Approach for Solving Multiple Travelling Salesman Problem using Ant Colony Optimization Krishna H. Hingrajiya University of Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal (M. P.), India Email: krishnahingrajiya@gmail.com
More informationOPTIMIZATION OF MULTI-TRIP VEHICLE ROUTING PROBLEM WITH TIME WINDOWS USING GENETIC ALGORITHM
Journal of Environmental Engineering & Sustainable Technology Vol. 03 No. 02, November 2016, Pages 92-97 JEEST http://jeest.ub.ac.id OPTIMIZATION OF MULTI-TRIP VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
More informationChapter 15 A Mathematical Model to Optimize Transport Cost and Inventory Level in a Single Level Logistic Network
Chapter 15 A Mathematical Model to Optimize Transport Cost and Inventory Level in a Single Level Logistic Network Laila Kechmane, Benayad Nsiri, and Azeddine Baalal Abstract This paper proposes a mathematical
More informationHybrid MIP method for a Pickup and Delivery Problem with Time Windows and Dock Service Constraints
International Journal of Operations Research International Journal of Operations Research Vol. 8, No. 1, 36 56 (2011) Hybrid MIP method for a Pickup and Delivery Problem with Time Windows and Dock Service
More informationweather monitoring, forest fire detection, traffic control, emergency search and rescue A.y. 2018/19
UAVs are flying vehicles able to autonomously decide their route (different from drones, that are remotely piloted) Historically, used in the military, mainly deployed in hostile territory to reduce pilot
More informationHybrid approaches to the Repositioning Problem in Bicycle-Sharing Systems
Hybrid approaches to the Repositioning Problem in Bicycle-Sharing Systems Juan David Palacio Domínguez PhD Student in Mathematical Engineering Juan Carlos Rivera Agudelo Thesis Advisor Doctoral Seminar
More informationSolving CCVRPTW using biased random key genetic algorithm (BRKGA) with multiple parent
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Solving CCVRPTW using biased random key genetic algorithm (BRKGA) with multiple parent To cite this article: H Prasetyo et al
More informationAN ANT COLONY APPROACH TO SOLVE A VEHICLE ROUTING PROBLEM IN A FMCG COMPANY SRINIVAS RAO T & PRAKASH MARIMUTHU K
International Journal of Mechanical and Production Engineering Research and Development (IJMPERD) ISSN(P): 2249-6890; ISSN(E): 2249-8001 Vol. 8, Issue 1 Feb 2018, 1113-1118 TJPRC Pvt. Ltd. AN ANT COLONY
More informationANT COLONY ALGORITHM APPLIED TO FUNDAMENTAL FREQUENCY MAXIMIZATION OF LAMINATED COMPOSITE CYLINDRICAL SHELLS
ANT COLONY ALGORITHM APPLIED TO FUNDAMENTAL FREQUENCY MAXIMIZATION OF LAMINATED COMPOSITE CYLINDRICAL SHELLS Rubem M. Koide 1 *, Marco A. Luersen 1 ** 1 Laboratório de Mecânica Estrutural (LaMEs), Universidade
More informationTrip attraction model of central market in Poso City based on multiple linier regression model
Trip attraction model of central market in Poso City based on multiple linier regression model Henny Indriyani Abulebu 1,*, BleiserTanari 1 and Muhammad Isran Ramli 1 Sintuwu Maroso University, Department
More informationTabu Search for the Vehicle Routing Problem with Multiple Trips, Time Windows and Simultaneous Delivery-Pickup
Jurnal Teknik Industri, Vol. 19, No. 2, Descember 2017, 75-82 ISSN 1411-2485 print / ISSN 2087-7439 online DOI: 10.9744/jti.19.2.75-82 Tabu Search for the Vehicle Routing Problem with Multiple Trips, Time
More informationRelative Study of CGS with ACO and BCO Swarm Intelligence Techniques
Relative Study of CGS with ACO and BCO Swarm Intelligence Techniques Abstract Ms. T.Hashni 1 Ms.T.Amudha 2 Assistant Professor 1, 2 P.S.G.R.Krishnammal College for Women 1, Bharathiar University 2 Coimbatore,
More informationUsing the Ant Colony Algorithm for Real-Time Automatic Route of School Buses
The International Arab Journal of Information Technology, Vol. 13, No. 5, September 2016 559 Using the Ant Colony Algorithm for Real-Time Automatic Route of School Buses Tuncay Yigit and Ozkan Unsal Department
More informationAn Early Exploratory Method to Avoid Local Minima in Ant Colony System
An Early Exploratory Method to Avoid Local Minima in Ant Colony System 33 An Early Exploratory Method to Avoid Local Minima in Ant Colony System Thanet Satukitchai 1 and Kietikul Jearanaitanakij 2, Non-members
More informationStrategies for Coordinated Drayage Movements
Strategies for Coordinated Drayage Movements Christopher Neuman and Karen Smilowitz May 9, 2002 Abstract The movement of loaded and empty equipment (trailers and containers) between rail yards and shippers/consignees
More informationUNMANNED AERIAL VEHICLES (UAVS)
UNMANNED AERIAL VEHICLES (UAVS) MONITORING BY UAVS I.E. WHAT? (SOME THESES PROPOSALS) UAVs are flying vehicles able to autonomously decide their route (different from drones, that are remotely piloted)
More informationNatural Computing. Lecture 10: Ant Colony Optimisation INFR /10/2010
Natural Computing Lecture 10: Ant Colony Optimisation Michael Herrmann mherrman@inf.ed.ac.uk phone: 0131 6 517177 Informatics Forum 1.42 INFR09038 21/10/2010 蚁群算法 Marco Dorigo (1992). Optimization, Learning
More informationUNIVERSITI PUTRA MALAYSIA DEVELOPMENT OF A HEURISTIC PROCEDURE FOR BALANCING MIXED MODEL PARALLEL ASSEMBLY LINE TYPE II GHOLAMREZA ESMAEILIAN
UNIVERSITI PUTRA MALAYSIA DEVELOPMENT OF A HEURISTIC PROCEDURE FOR BALANCING MIXED MODEL PARALLEL ASSEMBLY LINE TYPE II GHOLAMREZA ESMAEILIAN FK 2010 14 DEVELOPMENT OF A HEURISTIC PROCEDURE FOR BALANCING
More informationDepartment of Computer Science, BITS Pilani - K. K. Birla Goa Campus, Zuarinagar, Goa, India
Statistical Approach for Selecting Elite Ants Raghavendra G. S. Department of Computer Science, BITS Pilani - K. K. Birla Goa Campus, Zuarinagar, Goa, India Prasanna Kumar N Department of Mathematics,
More informationTitle: A Column Generation Algorithm for the Log Truck Scheduling Problem.
Title: A Column Generation Algorithm for the Log Truck Scheduling Problem. Authors: Myrna Palmgren Department of Optimization Linkoping University S-58183 Linkoping, Sweden e-mail: mypal@mai.liu.se Mikael
More informationA MICROSCOPIC TRAFFIC SIMULATION BASED DECISION SUPPORT SYSTEM FOR REAL-TIME FLEET MANAGEMENT
A MICROSCOPIC TRAFFIC SIMULATION BASED DECISION SUPPORT SYSTEM FOR REAL-TIME FLEET MANAGEMENT City CEDM City Distribution CEDM Distribution Terminal Terminal LOGISTICS BASE Jaume Barceló Hanna Grzybowska
More informationHours of service regulations in road freight transport: an optimization-based international assessment. Thibaut Vidal
Hours of service regulations in road freight transport: an optimization-based international assessment Thibaut Vidal Seminar, Universidade Federal Fluminense, March 15 th, 2013 Context of this research
More informationDynamic Vehicle Routing: State-of-the-art and some Research Perspectives
Dynamic Vehicle Routing: State-of-the-art and some Research Perspectives Michel Gendreau CIRRELT and MAGI Polytechnique Montréal EPFL Lausanne, Suisse July 20, 2016 Acknowledgements The work described
More informationDetermination of a Fair Price for Blood Transportation by Applying the Vehicle Routing Problem: A Case for National Blood Center, Thailand
Determination of a Fair Price for Blood Transportation by Applying the Vehicle Routing Problem: A Case for National Blood Center, Thailand S. Pathomsiri, and P. Sukaboon Abstract The National Blood Center,
More informationOPTIMIZATION OF LOGISTIC PROCESSES USING ANT COLONIES
OPTIMIZATION OF LOGISTIC PROCESSES USING ANT COLONIES C. A. Silva, T.A. Runkler J.M. Sousa, R. Palm Siemens AG Technical University of Lisbon Corporate Technology Instituto Superior Técnico Information
More informationCombination of nearest neighbor and heuristics algorithms for sequential two dimensional loading capacitated vehicle routing problem
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Combination of nearest neighbor and heuristics algorithms for sequential two dimensional loading capacitated vehicle routing problem
More informationSWARM INTELLIGENCE FROM NATURAL TO ARTIFICIAL SYSTEMS: ANT COLONY OPTIMIZATION
SWARM INTELLIGENCE FROM NATURAL TO ARTIFICIAL SYSTEMS: ANT COLONY OPTIMIZATION Abstract O. Deepa 1 and Dr. A. Senthilkumar 2 1 Research Scholar, Department of Computer Science, Bharathiar University, Coimbatore,
More informationA New Fuzzy Logic Approach to Dynamic Dial-a-Ride Problem
Proceedings of the 2012 Industrial and Systems Engineering Research Conference G. Lim and J.W. Herrmann, eds. A New Fuzzy Logic Approach to Dynamic Dial-a-Ride Problem Maher Maalouf Industrial & Systems
More informationImplementations of TSP-VRP Variants for Distribution Problem
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 1 (2016), pp. 723-732 Research India Publications http://www.ripublication.com Implementations of TSP-VRP Variants for Distribution
More informationA Process Oriented Modeling Concept for Rich Vehicle Routing Problems
Collaborative Research Center SFB559 Modeling of Large Logistic Networks Computer Science Algorithm Engineering A Process Oriented Modeling Concept for Rich Vehicle Routing Problems Andreas Reinholz VIP
More informationAn Evolutionary Approach to Pickup and Delivery Problem with Time Windows
An Evolutionary Approach to Pickup and Delivery Problem with Time Windows 2 Jean-Charles Créput 1, Abder Koukam 1, Jaroslaw Kozlak 1,2, and Jan Lukasik 1,2 1 University of Technology of Belfort-Montbeliard,
More informationCapacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization.
Capacitated Vehicle Routing Problem with Time Windows: A Case Study on Pickup of Dietary Products in Nonprofit Organization by Xiaoyan Li A Thesis Presented in Partial Fulfillment of the Requirements for
More informationMulti-vehicle Dispatching And Routing With Time Window Constraints And Limited Dock Capacity
University of Central Florida Electronic Theses and Dissertations Doctoral Dissertation (Open Access) Multi-vehicle Dispatching And Routing With Time Window Constraints And Limited Dock Capacity 2012 Ahmed
More informationAn Improved Ant Colony Algorithm for Optimal Path of Travel Research and Simulation
2016 International Conference on Artificial Intelligence: Techniques and Applications (AITA 2016) ISBN: 978-1-60595-389-2 An Improved Ant Colony Algorithm for Optimal Path of Travel Research and Simulation
More informationVehicle Routing with Departure Smoothing
ERASMUS UNIVERSITY ROTTERDAM Erasmus School of Economics Vehicle Routing with Departure Smoothing Master s Thesis Econometrics and Management Science Author: N.M. van der Zon Student ID: 387441 Supervisors:
More informationABSTRACT. Keywords: Quality cost reports, Managerial decision making. vii. Universitas Kristen Maranatha
ABSTRACT In a company quality cost holds a very important role for the company to increase profitability, the company needs to do to improve the quality of cost control the quality of its products. Quality
More informationBY: DAVIN VALENTIN SETIAWAN
THE IMPACT OF BRAND IMAGE, SERVICE QUALITY, AND SALES PROMOTION ON CUSTOMER REPURCHASE INTENTION THROUGH CUSTOMER SATISFACTION AT TOKOPEDIA IN SURABAYA BY: DAVIN VALENTIN SETIAWAN 3303014020 INTERNATIONAL
More informationTHE SOUTH AFRICAN POST OFFICE SUPPLY CHAIN DESIGN AND ROUTE OPTIMISATION BPJ 420 Final Report
THE SOUTH AFRICAN POST OFFICE SUPPLY CHAIN DESIGN AND ROUTE OPTIMISATION BPJ 420 Final Report Ricardo Batista U13045653 28 September 2016 0 EXECUTIVE SUMMARY The South African Post Office (SAPO) has experienced
More informationFaculty of Cognitive Sciences and Human Development
Faculty of Cognitive Sciences and Human Development A COMBINATORIAL OPTIMIZATION TECHNIQUE USING GENETIC ALGORITHM: A CASE STUDY IN MACHINE LAYOUT PROBLEM Lau Siew Yung Kota Samarahan 2007 A COMBINATORIAL
More informationABSTRACT. Timetable, Urban bus network, Stochastic demand, Variable demand, Simulation ISSN:
International Journal of Industrial Engineering & Production Research (09) pp. 83-91 December 09, Volume, Number 3 International Journal of Industrial Engineering & Production Research ISSN: 08-4889 Journal
More informationModeling and optimization of ATM cash replenishment
Modeling and optimization of ATM cash replenishment PETER KURDEL, JOLANA SEBESTYÉNOVÁ Institute of Informatics Slovak Academy of Sciences Bratislava SLOVAKIA peter.kurdel@savba.sk, sebestyenova@savba.sk
More informationA Tabu Search Metaheuristic Algorithm for the Multiple Depot Vehicle Routing Problem with Time Windows
A Tabu Search Metaheuristic Algorithm for the Multiple Depot Vehicle Routing Problem with Time Windows by Jonathan Abrie de Freitas 29089655 Submitted in partial fullment of the requirements for the degree
More informationTHE INFLUENCE OF CELEBRITY ENDORSEMENT AND CONSUMER TRUST TOWARD PURCHASE INTENTION IN DOTIC DONUT INSTAGRAM IN MALANG.
THE INFLUENCE OF CELEBRITY ENDORSEMENT AND CONSUMER TRUST TOWARD PURCHASE INTENTION IN DOTIC DONUT INSTAGRAM IN MALANG Thesis for S-1 BY : YOSUA SENDI SASONGKO 3303014006 INTERNATIONAL BUSINESS MANAGEMENT
More informationABSTRAhr. Model Berbilang gilir Berbilang Pelayan da1an.t Teori Baris gilir digunakan untuk
ABSTRAhr PENGOPTIMUMAN MASALAH PER'UNTUK4N BEBAN KERJA DALAM PERSEKITARAN SISTEM KOMPUTER-KOMPUTER HETEROGEN YANG BERANGKAIAN Model Berbilang gilir Berbilang Pelayan da1an.t Teori Baris gilir digunakan
More informationAIR FORCE INSTITUTE OF TECHNOLOGY
AUTO CARRIER TRANSPORTER LOADING AND UNLOADING IMPROVEMENT THESIS Brian M. Miller, Captain, USAF AFIT/GAI/ENS/03-02 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright-Patterson
More informationSCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES
SCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES Al-Naimi Assistant Professor Industrial Engineering Branch Department of Production Engineering and Metallurgy University of Technology Baghdad - Iraq dr.mahmoudalnaimi@uotechnology.edu.iq
More informationCloud Load Balancing Based on ACO Algorithm
Cloud Load Balancing Based on ACO Algorithm Avtar Singh, Kamlesh Dutta, Himanshu Gupta Department of Computer Science, National Institute of Technology,Hamirpur, HP, India Department of Computer Science,
More informationVendor Managed Inventory vs. Order Based Fulfillment in a. Specialty Chemical Company
Vendor Managed Inventory vs. Order Based Fulfillment in a Specialty Chemical Company Introduction By Dimitrios Andritsos and Anthony Craig Bulk chemicals manufacturers are considering the implementation
More informationThe Development of Hybrid Cross Entropy-Genetic Algorithm for Multi-Product Inventory Ship Routing Problem with Heterogeneous Fleet
Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 The Development of Hybrid Cross Entropy-Genetic Algorithm for Multi-Product
More informationINTEGRATED PROCESS PLANNING AND SCHEDULING WITH SETUP TIME CONSIDERATION BY ANT COLONY OPTIMIZATION
Proceedings of the 1st International Conference on Computers & Industrial Engineering INTEGRATED PROCESS PLANNING AND SCHEDULING WITH SETUP TIME CONSIDERATION BY ANT COLONY OPTIMIZATION S.Y. Wan, T.N.
More informationThe Two-Echelon Capacitated Vehicle Routing. Problem
The Two-Echelon Capacitated Vehicle Routing Problem Jesus Gonzalez Feliu 1, Guido Perboli 1, Roberto Tadei 1 and Daniele Vigo 2 1 Control and Computer Engineering Department Politecnico di Torino, Italy
More informationPI-Controller Tuning For Heat Exchanger with Bypass and Sensor
International Journal of Electrical Engineering. ISSN 0974-2158 Volume 5, Number 6 (2012), pp. 679-689 International Research Publication House http://www.irphouse.com PI-Controller Tuning For Heat Exchanger
More informationPost-doc researcher, IRIDIA-CoDE, Université Libre de Bruxelles, Bruxelles, Belgium.
PaolaPellegrini Personal information Name Paola Pellegrini Address Bruxelles, Belgium E-mail paolap@pellegrini.it Nationality Italian Date of birth 11-25-1980 Research Interests Optimization, metaheuristics,
More informationVehicle Routing with Cross Docks, Split Deliveries, and Multiple Use of Vehicles. Arun Kumar Ranganathan Jagannathan
Vehicle Routing with Cross Docks, Split Deliveries, and Multiple Use of Vehicles by Arun Kumar Ranganathan Jagannathan A thesis submitted to the Graduate Faculty of Auburn University in partial fulfillment
More informationCVEN 5393 April 1, 2013
CVEN 5393 April 1, 2013 Topics Revisit multi-objective optimization Heuristics and Metaheuristics a conceptual overview Multi-criteria decision analysis Multiobjective Optimization Topics Multiple objectives
More informationIT PROJECT DISTRIBUTION AUTOMATION
IT PROJECT DISTRIBUTION AUTOMATION 1 Aniket Kale, 2 Ajay Sonune, 3 Om Awagan, 4 Sandeep Chavan, 5 Prof. Rupali Dalvi 1, 2,3,4,5 Department of Computer Engineering, Marathwada Mitra Mandal s College of
More informationA VEHICLE ROUTING PROBLEM WITH STOCHASTIC TRAVEL TIMES. T. Van Woensel, L. Kerbache, H. Peremans and N. Vandaele
A VEHICLE ROUTING PROBLEM WITH STOCHASTIC TRAVEL TIMES T. Van Woensel, L. Kerbache, H. Peremans and N. Vandaele University of Antwerp, +32 3 220 40 69, tom.vanwoensel@ua.ac.be HEC School of Management,
More informationAN ADAPTIVE LARGE NEIGHBORHOOD SEARCH ALGORITHM FOR A SELECTIVE & PERIODIC INVENTORY ROUTING PROBLEM
AN ADAPTIVE LARGE NEIGHBORHOOD SEARCH ALGORITHM FOR A SELECTIVE & PERIODIC INVENTORY ROUTING PROBLEM Deniz Aksen 1, Onur Kaya 2, F. Sibel Salman 2, Özge Tüncel 2 1 College of Adm. Sci. and Econ., Koç University,
More information