A Study of the Selective Customer Service Routing Problems with Mandatory Visits

Project: National Science and Technology CouncilNational Science and Technology Council Academic Grants

Project Details

Abstract

In Taiwan, the service sector share of GDP is much higher than the manufacturing sector. Therefore, to improve the operating efficiency of the service sector will be possible to improve the overall standard of Taiwan's service industry, to further enhance the competitiveness of Taiwan's service industry. In the service sector, to consolidate customer relationships and enhance brand loyalty, is the responsibility of business owners and the business representatives. For many service industries, the business or service personnel must go to the customer within the specified time (time window). After serving the customers, they can get some reward. Services mentioned here contains a wide variety of tasks, such as, business visits, distribution, maintenance, home care, data collection, and cleaning, etc. For business (or service), the customer visit is an important way to maintain customer relationships, and other jobs may be the source of the company's revenue. In consideration of the company operating costs, labor expenses and the time budget, for companies with hundreds or even thousands of customers, how to effectively plan the most effective customer visits (or service ) route is an important issue, because it has the direct relationship between with the company's competitiveness or profitability. This proposal intends to accomplish the following items to provide a better routing plan for the selective customer routing problems in service sector: (1) Clearly defines various selective customer routing problems and establishes their mathematical model, including: I. Selective customer service routing problems with mandatory visits; II. Selective customer service routing problems with mandatory visits and cost of personnel; III. Selective customer service routing problems with mandatory visits, cost of personnel, multiple time window, and time-dependent scores; IV. Bi-objective selective customer service routing problems with mandatory visits, cost of personnel, multiple time window, and time-dependent scores; (2) Because selective customer service routing problems with mandatory visits belongs to NP-hard problem, how to find a (approximate) optimal solution within an acceptable computational time is an important issue. This proposal plans to develop two kinds of nature-inspired algorithms (hybrid teaching and learning based optimization algorithm and hybrid flower pollination algorithms) to obtain the acceptable solutions of this kind of problem within the reasonable time. (3) Teaching and learning based optimization algorithm and flower pollination algorithm are two recent natural-inspired algorithms. If they can be used to solve the selective customer service routing problems, they can also be used to solve other kinds of combinatorial problems in theory.

Project IDs

Project ID:PB10601-0673
External Project ID:MOST105-2410-H182-009-MY2
StatusFinished
Effective start/end date01/08/1731/07/18

Keywords

  • Service Routing Problem with Selective Customers
  • Mandatory Customers
  • Mixed Integer

Fingerprint

Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.