Narrow search
Showing 1 - 10 of 175,430
Cover Image
Tabu search and memetic algorithms for a real scheduling and routing problem
El-Yaakoubi, Anass; El Fallahi, Abdellah; Cherkaoui, … - In: Logistics research 10 (2017) 7, pp. 1-18
methodology and memetic algorithm are proposed to solve it. These algorithms are tested on a set of real instances and others …
Persistent link: https://www.econbiz.de/10011892666
Cover Image
Hybrid Differential Evolution and Particle Swarm Optimization for Multi-Visit and Multi-Period Workforce Scheduling and Routing Problems
Punyakum, Voravee; Sethanan, Kanchana; Nitisiri, Krisanarach - 2022
This research proposed an optimization method using a solution technique based on two well-known techniques, differential evolution and particle swarm optimization, to tackle a multi-visit and multi-period workforce scheduling and routing problem in field service operation of a sugarcane mill...
Persistent link: https://www.econbiz.de/10013302660
Cover Image
Maximizing the nurses' preferences in nurse scheduling problem : mathematical modeling and a meta-heuristic algorithm
Jafari, Hamed; Salmasi, Nasser - In: Journal of industrial engineering international 11 (2015), pp. 439-458
-heuristic algorithm based on simulated annealing (SA) is applied to heuristically solve the problem in a reasonable time. An initial … feasible solution generator and several novel neighborhood structures are applied to enhance performance of the SA algorithm … algorithm. The results of computational experiments indicate that the applied SA algorithm provides solutions with average …
Persistent link: https://www.econbiz.de/10011562610
Cover Image
A hybrid solution approach for the 3L-VRP with simultaneous delivery and pickups
Koch, Henriette; Bortfeldt, Andreas; Wäscher, Gerhard - 2017
a delivery section and a pickup section and (ii) loading at the long side. A hybrid algorithm is proposed for the 3L …
Persistent link: https://www.econbiz.de/10011641365
Cover Image
Integrated order picking and vehicle routing with due dates
Schubert, Daniel; Scholz, André; Wäscher, Gerhard - 2017
iterated local search algorithm is designed for the simultaneous solution of the subproblems. By means of extensive numerical …
Persistent link: https://www.econbiz.de/10011641475
Cover Image
Exact algorithms for singlemachine scheduling with time windows and precedence constraints
Davari, Morteza; Demeulemeester, Erik; Leus, Roel; … - 2013
Persistent link: https://www.econbiz.de/10010238508
Cover Image
Optimal Design of Timetables to Maximize Schedule Reliability & Minimize Energy Consumption, Rolling Stock and Crew Deployment
Nag, Bodhibrata; Pal, Manabendra Nath - 2013
We have developed a non-linear multi-objective model for optimal design of railway timetables. The objectives of the model are to maximize schedule reliability and minimize energy consumption, rolling stock and crew deployment. Metrics have been derived for each of these objectives. AHP is used...
Persistent link: https://www.econbiz.de/10014153838
Cover Image
A Polynomial Algorithm for Special Case of the One-Machine Scheduling Problem with Time-Lags
Ramalhinho Dias Lourenço, Helena - 2007
-lags, where the time-lags have a chain form, and propose a polynomial algorithm to solve it. The algorithm consist in a polynomial …
Persistent link: https://www.econbiz.de/10014046304
Cover Image
Models and Algorithms for Integration of Vehicle and Crew Scheduling
Freling, Richard; Huisman, Dennis; Wagelmans, Albert P. M. - 2012
This paper deals with models, relaxations and algorithms for an integrated approach to vehicle and crew scheduling. We discuss potential benefits of integration and provide an overview of the literature, which considers mainly partial integration. Our approach is new in the sense that we can...
Persistent link: https://www.econbiz.de/10014092644
Cover Image
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el; Glazik, Christian; Sauerland, Volkmar; … - In: Games 9 (2018) 1/2, pp. 1-12
Mastermind is a two players zero sum game of imperfect information. Starting with Erdos and Rényi (1963), its combinatorics have been studied to date by several authors, e.g., Knuth (1977), Chvátal (1983), Goodrich (2009). The first player, called “codemaker”, chooses a secret code and the...
Persistent link: https://www.econbiz.de/10011771356