• DocumentCode
    3539252
  • Title

    Service cost and waiting time-a multi-objective optimization scenario

  • Author

    Gonsalves, Tad ; Yamagishi, Kei ; Toh, K.

  • Author_Institution
    Dept. of Inf. & Commun. Sci., Sophia Univ., Tokyo, Japan
  • fYear
    2009
  • fDate
    4-6 Aug. 2009
  • Firstpage
    369
  • Lastpage
    374
  • Abstract
    The goal of service systems is to provide cost-efficient service to customers, while at the same time, reducing the customer waiting time for service. In general, a low cost in system operation leads to longer waiting times, while a higher cost in system operation leads to shorter waiting times. The two objectives-service cost (operational cost) and waiting time (customer satisfaction) are, therefore, conflicting in nature. In this paper, we cast the problem as a multi-objective optimization problem and use the multi-objective particle swarm optimization (MOPSO) algorithm to optimize the two conflicting objective functions simultaneously. MOPSO is a fairly recent swarm intelligence meta-heuristic algorithm known for its simplicity in programming and its rapid convergence. The multi-objective optimization procedure is illustrated with the example of a practical service system. MOPSO produces a family of well-spread Pareto fronts for the two objective functions in the practical service system.
  • Keywords
    customer satisfaction; customer services; particle swarm optimisation; customer satisfaction; multiobjective optimization scenario; multiobjective particle swarm optimization; service cost-and-waiting time; swarm intelligence meta-heuristic algorithm; Biological processes; Convergence; Cost function; Customer satisfaction; Evolutionary computation; Genetic algorithms; Lead time reduction; Particle swarm optimization; Personnel; Quality of service;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Applications of Digital Information and Web Technologies, 2009. ICADIWT '09. Second International Conference on the
  • Conference_Location
    London
  • Print_ISBN
    978-1-4244-4456-4
  • Electronic_ISBN
    978-1-4244-4457-1
  • Type

    conf

  • DOI
    10.1109/ICADIWT.2009.5273862
  • Filename
    5273862