Close category search window
 

Multi-objective Optimization of Bus Dispatching Based on Improved Genetic Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jinling Du ; Sch. of Manage. Eng., Shan Dong Jianzhu Univ., Ji''nan, China ; Chunxiao Wang ; Feng Zhang

Bus trip is a healthy way to travel, and optimal bus dispatching decides social and economic benefits. Based on the analysis for both the existing traffic environment and bus dispatching, a mathematical model is proposed in this paper such that the goal function of this model are the average maximal satisfaction for passengers, the average loading rate of the maximum and the minimal average bus departure frequency of the bus company, respectively. Furthermore, the genetic algorithm is improved further to prevent premature for the algorithm and ensure fast convergence of the algorithm. Finally, case analysis gives a satisfying departure interval for each time period in a day and verifies the effectiveness of the algorithm.

Published in:
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on

Date of Conference: 3-4 Dec. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.