Comparison of fuzzy C-mean clustering and 0-1 integer programming model for employee routing problem Online publication date: Sat, 16-Aug-2014
by R.A. Malairajan; K. Ganesh; K. Nallasivam; M. Punniyamoorthy
International Journal of Value Chain Management (IJVCM), Vol. 6, No. 4, 2012
Abstract: In a real time life, vehicle routing problems (VRP) arises whenever a set of vehicles is available to serve a set of transportation requests. The work carried in this paper focuses on understanding the concept of VRP and applying the techniques to a real time problem, which relates to the picking up of employees of an organisation by a fleet of buses. The problem is modelled as a employee routing problem (ERP), i.e., each bus has a limited number of seats and the number of employees picked up by each bus should be less than or equal to the maximum capacity of the bus. The techniques used here are fuzzy C-mean clustering and 0-1 integer programming model for obtaining the allocation of employees to each bus. The other techniques include nearest neighbourhood, which is used to obtain the initial route for the buses and 2-opt method, which is used to improve the travelling route by reducing the total cost and thus it helps in achieving the objective of ERP.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Value Chain Management (IJVCM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook