Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Efficient Scheduling for Salesperson Monitoring System

영업사원 관제시스템의 효율적인 경로 스케줄링

  • Kim, Seung (Department of Industrial Engineering, Pusan National University) ;
  • Min, Yeong-Bin (Department of Industrial Engineering, Seoul National University) ;
  • Lee, Woo-Key (Department of Industrial Engineering, Inha University) ;
  • Bae, Hye-Rim (Department of Industrial Engineering, Pusan National University)
  • 김승 (부산대학교 산업공학과) ;
  • 민영빈 (서울대학교 산업공학과) ;
  • 이우기 (인하대학교 산업공학과) ;
  • 배혜림 (부산대학교 산업공학과)
  • Received : 2011.05.19
  • Accepted : 2011.10.20
  • Published : 2011.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

Salesperson Monitoring System (SMS) is geographic based information system that supports business auditing, sales area coordinating and customer management for each salesperson. Conventional SMSs focus mainly on the monitoring or logging functions, i.e., a salesperson locating or moving trail tracking. However, the schedules have been planned by human planner, and they have rarely been managed with a software system like SMS. In this paper, a mixed integer programming model for a salesperson routing schedule is provided. Then, 2-phase Genetic Algorithm (GA) is proposed to make salesperson routing schedule. Experimental results show a validity of the proposed method.

Keywords

References

  1. Clarke, K. C. (1986), Advances in geographic information systems, Computers, Environment and Urban Systems, 10(3/4), 175-184. https://doi.org/10.1016/0198-9715(86)90006-2
  2. Cordeau, J. F., Desaulniers, G., Desrosiers, J., Solomon, M. M., and Soumis, F. (2001), The VRP with time windows, The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA, 157-194.
  3. Desrosiers, J., Dumas, Y., Solomon, M. M., and Soumis, F. (1995), Time constrained routing and scheduling, Handbooks in Operations Research and Management Science 8 : Network Routing, Elsevier Science Publishers, Amsterdam, The Netherlands, 35-139.
  4. Desrochers, M., Lenstra, J. K., Savelsbergh, M. W. P., and Soumis. F. (1988), Vehicle routing with time windows : Optimization and approximation, Vehicle Routing : Methods and Studies, Elsevier Science Publishers, Amsterdam, The Netherlands, 65-84.
  5. Fisher, M. and Jaikumar, R. (1981), A generalized assignment heuristic for vehicle routing, Networks, 11(2), 109-124. https://doi.org/10.1002/net.3230110205
  6. Golden, B. L. and Assad, A. A. (1986), Perspectives on vehicle routing : Exciting new developments, Operations Research, 34(5), 803- 809. https://doi.org/10.1287/opre.34.5.803
  7. Kellegöz, T., Toklu, B., and Wilson, J. (2008), Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem, Applied Mathematics and Computation, 199(2), 590- 598.
  8. Lee, M. H., Kim, N. H., and Shin, J. Y. (2000), Design of Heuristic Algorithm of Automatic Vehicle Delivery Support System, Journal of Industrial and Systems Engineering, 23(58), 59-69.
  9. Lenstra, J. and Kan R. (1981), Complexity of Vehicle Routing and Scheduling Problems, Networks, 11(2), 221-227.
  10. Russell, R. (1977), An effective heuristic for the M-tour traveling salesman problem with some side conditions, Operations Research, 25 (3), 517-524. https://doi.org/10.1287/opre.25.3.517
  11. Savelsbergh, M. W. P. (1990), An efficient implementation of local search algorithms for constrained routing problems, European Journal of Operational Research, 47(1), 75-85.
  12. Savelsbergh, M. W. P. (1992), The vehicle routing problem with time windows : Minimizing route duration, ORSA Journal on Computing, 4(2), 146-154. https://doi.org/10.1287/ijoc.4.2.146
  13. Solomon, M. M. (1986), On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints, Networks, 16(2), 161-174 https://doi.org/10.1002/net.3230160205
  14. Solomon, M. M., Baker, E. K., and Schaffer, J. R. (1988), Vehicle routing and scheduling problems with time window constraints : Efficient implementations of solution improvement procedures, Vehicle Routing : Methods and Studies, Elsevier Science Publishers, Amsterdam, The Netherlands, 85-106.
  15. Solomon, M. M. and Desrosiers, J. (1988), Time window constrained routing and scheduling problems, Transportation Science, 22(1), 1-13.
  16. Starkwether, T., McDaniel, S., Mathias, K., Whitley, C., and Whitley, D. (1991), A Comparison of Genetic Sequencing Operators, Proc. of the 4th Int. Conf. on Genetic Algorithms, Morgan Kaufmann Publishers, Los Altos, CA, 69-76.
  17. Xing, L. N., Chen, Y. W., Yang, K. W., Hou, F., Shen, X. S., and Cai, H. P. (2008), A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem, Engineering Applications of Artificial Intelligence, 21(8), 1370-1380. https://doi.org/10.1016/j.engappai.2008.01.003
  18. TSPLIB, http://www.iwr.uni-heidelberg.de/groups/comopt/software/ TSPLIB95/.