EU/ME - the metaheuristics community

  • Increase font size
  • Default font size
  • Decrease font size
EU/ME - the metaheuristics community

Transportation Research Part B: Methodological, 46(1), 2012

E-mail Print PDF

Efficient Transit Schedule Design of timing points: A comparison of Ant Colony and Genetic Algorithms

by Ehsan Mazloumi, Mahmoud Mesbah, Avi Ceder, Sara Moridpour and Graham Currie

AbstractThis work defines Transit Schedule Design (TSD) as an optimization problem to construct the transit schedule with the decision variables of the location of timing points and the amount of slack time associated with each timing point. Two heuristic procedures, Ant Colony and Genetic Algorithms, are developed for constructing optimal schedules for a fixed bus route. The paper presents a comparison of the fundamental features of the two algorithms. They are then calibrated based on data generated from micro-simulation of a bus route in Melbourne, Australia, to give rise to (near) optimal schedule designs. The algorithms are compared in terms of their accuracy and efficiency in providing the minimum cost solution. Although both procedures prove the ability to find the optimal solution, the Ant Colony procedure demonstrates a higher efficiency by evaluating less schedule designs to arrive at a ‘good’ solution. Potential benefits of the developed algorithms in bus route planning are also discussed.

Read more...
 

Journal of Heuristics 17(6), 2011

E-mail Print PDF

A comparative study of crossover in differential evolution

by Chuan Lin, Anyong Qing and Quanyuan Feng

Abstract: In order to understand the role of crossover in differential evolution, theoretical analysis and comparative study of crossover in differential evolution are presented in this paper. Two new crossover methods, namely consecutive binomial crossover and non-consecutive exponential crossover, are designed. The probability distribution and expectation of crossover length for binomial and exponential crossover used in this paper are derived. Various differential evolution algorithms with different crossover methods including mutation-only differential evolution are comprehensively compared at system level instead of parameter level. Based on the theoretical analysis and simulation results, the effect of crossover on the reliability and efficiency of differential evolution algorithms is discussed. Some insights are revealed.

Last Updated on Tuesday, 22 November 2011 10:13 Read more...
 

EU/ME mailing list opt-out

E-mail Print PDF

Some people have written us that they do not want to receive emails from the EU/ME mailing list. We have therefore created an opt-out option.

Last Updated on Thursday, 10 November 2011 09:37 Read more...
 

Computers & Operations Research 39 (7) 2012

E-mail Print PDF

Synchronized arc routing for snow plowing operations

by M. Angélica Salazar-Aguilar, André Langevin, and Gilbert Laporte

Abstract: This paper introduces a synchronized arc routing problem for snow plowing operations. In this problem, routes must be designed in such a way that street segments with two or more lanes in the same direction are plowed simultaneously by different synchronized vehicles. A mixed integer formulation and an adaptive large neighborhood search heuristic are proposed. The performance of the proposed algorithm is evaluated over a large instance set, including artificial and real data. Computational results confirm the efficiency of the algorithm.

Last Updated on Monday, 21 November 2011 07:26 Read more...
 

EJOR 217(2), 2012

E-mail Print PDF
Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
 
by Justin C. Goodsona, Jeffrey W. Ohlmann, and Barrett W. Thomas
 
Abstract:
We examine neighborhood structures for heuristic search applicable to a general class of vehicle routing problems (VRPs). Our methodology utilizes a cyclic-order solution encoding, which maps a permutation of the customer set to a collection of many possible VRP solutions. We identify the best VRP solution in this collection via a polynomial-time algorithm from the literature. We design neighborhoods to search the space of cyclic orders. Utilizing a simulated annealing framework, we demonstrate the potential of cyclic-order neighborhoods to facilitate the discovery of high quality a priori solutions for the vehicle routing problem with stochastic demand (VRPSD). Without tailoring our solution procedure to this specific routing problem, we are able to match 16 of 19 known optimal VRPSD solutions. We also propose an updating procedure to evaluate the neighbors of a current solution and demonstrate its ability to reduce the computational expense of our approach.
Last Updated on Monday, 07 November 2011 09:04 Read more...
 


Page 9 of 14

Newsflash

EU/ME 2017

Submit now your abstract.

Polls

Should we trust "Open access journals"?
 

Metaheuristics Events

<<  January 2018  >>
 Mo  Tu  We  Th  Fr  Sa  Su 
  1  2  3  4  5  6  7
  8  91011121314
15161718192021
22232425262728
293031    

Who's Online

We have 77 guests online