Product Service Scheduling Problem with Service Matching Based on Tabu Search Method

Cheng Hao, Liu; Yan Hong, Wang; Wei, Qiu Jia; Zhao, Dong Wei; Rui, Shan

doi:https://doi.org/10.1155/2020/5748680

Journal of Advanced Transportation

On this page

Abstract Introduction Discussion and Conclusion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2020 | Article ID 5748680 | https://doi.org/10.1155/2020/5748680

Product Service Scheduling Problem with Service Matching Based on Tabu Search Method

Liu Cheng Hao,¹Wang Yan Hong,²Qiu Jia Wei,³Dong Wei Zhao,²and Shan Rui²

Academic Editor: Maria Vittoria Corazza

Received07 Apr 2019

Revised06 Dec 2019

Accepted26 Dec 2019

Published01 Feb 2020

Abstract

This paper considers the product service scheduling problem with service matching. This problem is a complex scheduling problem that integrates multiple traveling salesman problem (MTSP) and multiple service types. To solve the problem, a tabu search method was presented. With the objective of minimizing the total of engineers’ travel distances, total of the customer penalty values, and makespan, an optimization model of this problem is established. The historical search solutions are taken as tabu object, and limiting the quantity of search neighborhood solution is taken as the aspiration level. At last, the adaptability, validity, and stability of the model are verified by an example.

1. Introduction

With the continuous development of industrial technology, the scale of production is constantly expanding, which leads to homogenizing of products. In the fierce market competition, manufacturing enterprises cannot profit only by selling products. Product service systems that integrate product and service could meet customers’ individualized and diversified requirements more comprehensively. Service scheduling problem is an important part of product service integration. The product service scheduling problem with service matching is a multicomplex scheduling problem with the integration of multiple traveling salesman problem and multiple service types. In 2000, the concept of field-workforce scheduling was presented by Lesaint et al. Field-workforce scheduling is about sending the right engineer to the right customer at the right place at the right time with the right equipment at any time and in any operational environment [1].

Traditional multiple traveling salesmen problem mainly considered routing optimization. So far, many scholars have used different methods to solve it. Wacholder et al. [2] developed an efficient neural network algorithm for solving MTSP. Samerkae et al. [3] introduced a new algorithm in competition-based network to solve the Min-Max MTSP, which needs the maximum distance among all salesmen to be minimum. Ombuki et al. [4] represented the Vehicle Routing Problem with Time Windows as a multiobjective problem and presented a genetic algorithm solution using the Pareto ranking technique. Singh and Baghel [5] proposed a new grouping genetic algorithm based approach for MTSP. Kivelevitch et al. [6] described a market-based solution to the problem of assigning mobile agents to tasks and considered both the classical MTSP, in which the sum of all tour lengths is minimized, and the Min-Max MTSP, in which the longest tour is minimized. Kai et al. [7] used a modified NSGA-II algorithm to solve resource service scheduling with three objectives: comprehensive customer satisfaction degree, resource utility efficiency, and product service cost. Changdar et al. [8] presented a genetic-ant colony optimization algorithm to solve a solid MTSP in fuzzy rough environment. Yongzhen et al. [9] considered the MTSP with the Min-Max objective, which includes more than one salesman to serve a set of cities while minimizing the maximum distance traveled by any salesman and proposed a novel memetic algorithm, which integrates with a sequential variable neighborhood descent that is a powerful local search procedure to exhaustively search the areas near the high-quality solutions. Bellenguez-Morineau and Néron [10] and Caramia and Giordani [11] considered matching assignment of service types but did not consider route optimization problem. Yousefikhoshbakht et al. [12] presented a new modified version of the ant colony optimization mixed with insert, swap, and 2-opt algorithm called NMACO for solving MTSP, which utilizes an effective criterion for escaping from the local optimum points. Singh and Aslam Lodhi [13] made the attempt to show how genetic algorithm can be applied to the MTSP with ability constraint and compared MTSP in terms of distance and iteration by considering several set of cities. Yuan et al. [14] proposed a new crossover operator called two-part chromosome crossover for solving MTSP using a genetic algorithm for near-optimal solutions. Ponraj and Amalanathan [15] solved optimizing multiple traveling salesman problem considering the road capacity. Chen [16] presented a new algorithm, named EDAMLA, which is based on self-guided genetic algorithm with a minimum loading assignment rule to solve MTSP. Bolañosa et al. [17] proposed a nondominated sorting genetic algorithm (NSGA-II) to solve a multiobjective version of the multiple traveling salesman problem. Kota and Jarmai [18] described a single-phase algorithm for the fixed destination multidepot multiple traveling salesman problem with multiple tours. Shabanpour et al. [19] proposed a new combinatorial algorithm named CGA-MTSP for solving MTSP problem, which is a combination of genetic algorithm and clustering technique. Kalmár-Nagy et al. [20] described a variant of the classical multiple traveling salesmen problem. Xinye et al. [21] proposed a biobjective ant colony optimization based memetic algorithm to solve MTSP.

Tabu search method has many advantages such as being easy to understand, being easy to achieve, wide range of application, strong ability of local development, and fast convergence speed. We proposed a tabu search method for product service scheduling problem with service matching. Tabu search method has been widely used in many fields. Castelino et al. [22] presented the application of a tabu search algorithm for solving the frequency assignment problem. Alcaide et al. [23] proposed a tabu search algorithm for the solution of the problem, which uses simple fist scheduling algorithms to build the starting solutions. Ponnambalam et al. [24] considered the tabu search technique to solve job shop scheduling problems. Girard et al. [25] presented a fast tabu search method for the design of access tree networks. Alvarez-Valdfes et al. [26] dealt with the problem of assigning teachers to courses in a secondary school. Shin et al. [27] modified the original tabu search method to be suitable for the scheduling problem that schedules some jobs to a single machine in order to minimize the maximum lateness of the jobs. Alvarez-Valdes et al. [28] presented a new heuristic algorithm for the pallet loading problem, the problem of packing the maximum number of identical rectangular boxes onto a rectangular pallet. Saidi-Mehrabad and Fattahi [][][29] presented a tabu search algorithm that solves the flexible job shop scheduling problem to minimize the makespan time. Özcan and Toklu [30] presented a tabu search algorithm for two-sided assembly line balancing. Kailiang et al. [31] considered the problem of scheduling some jobs with arbitrary release dates and due dates on a single machine, where job-processing times can be controlled by the allocation of a common resource, and the operation is modelled by a nonlinear convex resource consumption function. Liao and Huang [32] proposed two Tabu search based algorithms to solve the complicated nonpermutation flow shop problems. Abdelaziz et al. [33] used a modified Tabu Search algorithm to reconfigure distribution systems so that active power losses are globally minimized with turning on/off sectionalizing switches. Shiguemotoa and Armentano [34] proposed a tabu search procedure for solving the problem of optimally coordinating a production-distribution system over a multiperiod finite horizon, where a facility production produces several items that are distributed to a set of customers by a fleet of homogeneous vehicles. Bolduc et al. [35] proposed a tabu search heuristic for the split delivery Vehicle Routing Problem with Production and Demand Calendars. Armentano et al. [36] proposed two tabu search variants for minimizing production and inventory costs at the plant, inventory costs at the customers, and distribution costs. Liao and Huang [37] proposed a heuristic based on tabu search technique and compared the proposed heuristic with a heuristic based on mixed integer linear programming. Kil-Woong [38] proposed a routing optimization algorithm to efficiently determine an optimal path from a source to a destination in mobile ad-hoc networks. Kasperski et al. [39] dealt with the strongly NP-hard Min-Max regret version of the minimum spanning tree problem with interval costs. Lamghari and Dimitrakopoulos [40] presented a metaheuristic solution approach based on tabu search for the open-pit mine production scheduling problem with metal uncertainty. González et al. [41] tackled the job shop scheduling problem with sequence-dependent setup times and maximum lateness minimization by means of a tabu search algorithm. Gallego et al. [42] developed search mechanisms, based on the tabu search methodology, for the maximally diverse grouping problem, including a strategic oscillation that enables search paths to cross a feasibility boundary. Koutsoukis et al. [43] introduced a recursive tabu search method to solve the optimal phasor measurement units placement problem. Nguyen et al. [44] proposed a tabu search metaheuristic for the time-dependent multizone multitrip Vehicle Routing Problem with Time Windows. Ho and Szeto [45] presented an iterated tabu search heuristic to solve the static bike repositioning problem. Junior et al. [46] presented a multiobjective tabu search algorithm to solve the multistage planning problem of a distribution system formulated as a multiobjective dynamic mixed integer nonlinear programming problem. Liu et al. [47] proposed a tabu search method combined with different local search schemes including both feasible and infeasible local searches. Yao et al. [48] employed the tabu search algorithm to optimize the Support Vector Machine parameters to accurately detect incidents in expressways. Li et al. [49] developed a tabu search to produce high-quality solutions of the dynamic lot sizing problem with product returns and remanufacturing. Buyang et al. [50] presented a tabu search algorithm for a new problem class called cohesive clustering, which arises in a variety of business applications. Alshibli et al. [51] used tabu search to obtain the optimal solution for disassembly sequencing.

The rest of this paper is organized as follows. In Section 2, the mathematical formulation of product service scheduling problem with service matching is presented. Section 3 describes the tabu search method in detail. Section 4 demonstrates the application of tabu search method to a case of product service scheduling problem with matching, and finally conclusions are summarized in Section 5.

2. Problem Description and Formulation

2.1. Problem Description

Product service scheduling problem with service matching could be understood abstractly as a graph model as follows [52].

Road network G = (C, A), customer nodes set C = {1, 2, …, c}, A is the set of all possible path, and (i, j) ∈ A is the path from customer or engineer i to customer j. B is the set of the all engineers’ nodes; N = B ∪ C is the set of all nodes [52]. The service type set Z = {1, 2, …, z} and there are two kinds of service types in this paper.

There are e engineers in the enterprise, so set E = {1, 2, …, e}. Each engineer has different service capabilities of different service types. The time required for engineer k's service type z is T_kz. Each customer only needs one type service. st_jz indicates the logical value of service type z required by customer z. When st_jz is 1, the service type that represents customer j needs is z; otherwise it is 0.

The time to start serving customer j is S_j. C_k is the time when engineer k ends all services. Different customers have different weights. The weight of customer j is W_j and the penalty value of customer j is S_j · W_j.

t_ij is the time required from customer i to customer j, which is a known constant. ta_ik is the time when engineer k arrives at customer i.

x_ijk indicates whether engineer k goes through (i, j). If engineer k goes to customer j via customer i, x_ijk = 1; else x_ijk = 0.

2.2. Objective

The engineers’ walking total distance should be as short as possible.

In order to maximize customer satisfaction, minimizing the total penalty value will be needed.

In order to balance the working strength of each engineer and make all engineers finish their work as early as possible, minimizing the whole time of maintenance service will be needed.

2.3. Constraints

Each customer must and will only be served once and can only be served by one engineer.

After engineer k serves customer p, he must leave from customer p when he takes over new tasks.

If engineer k serves customer i and then serves customer j, and the service type needed by customer i is z, then

Starting time

The time when engineer k ends all the maintenance services

Decision variables are

3. Tabu Search Method

3.1. The Steps of Method

The tabu search method is used in this paper to solve the mathematical model of technical service scheduling with service matching.

The merged objective function is

In this method, H is the current solution. NG, which is a simple and easy-to-operate limited maximum iteration step, is used as the stopping rule. In order to avoid trapping in the local optimum, this method gives the number n of limiting search neighborhood solutions; that is, when n neighborhood solutions of the current solution are searched but no neighborhood solution better than the current solution is found, the optimal solution of the N neighborhood solutions is assigned to the current solution. To avoid loops, the method needs to put the history current solution in the tabu table. This method takes the historical current solution as a tabu object; that is, after moving to the current solution, the current solution is stored in the tabu table.

NG and n are given. The current solution and the current optimal solution are default to the initial solution, i.e., H=O,opt=O. The tabu table T is empty. Iteration index k and neighborhood solution search index i are 0.

The initial solution O is obtained by uniformly assigning customers to engineers. For example, when two engineers serve four customers, the initial solutions are c₁e₁, c₂e₂, c₃e₁, and c₄e₂.

Flow chart of tabu search method is as shown in Figure 1.

4. Simulation Results and Analyses

4.1. Operating Environment

We implement method by programming with C++. The details of the operating environment are given as follows: CPU: Intel(R) Core(TM) i5-3337U CPU@1.80 GHz Memory: 4.00 GB Kernel: two cores Compiler: Microsoft Visual C++ 6.0 Operation system: 64-bit Windows 7, flagship edition

4.2. Simulation Result

Suppose that a manufacturing company has three engineers and now there are nine customers needed to be served. Distances between engineers and customers and between customers and customers are shown in Table 1. Service hours of different engineers serving different customers are shown in Table 2. Customer weights and service times and service types required by customers are shown in Table 3. The adaptive values of initial solutions and parameter settings are shown in Table 4.

The final adaptive values of the tabu search method and the objective function of the optimal solution for this example are shown in Table 5. The convergence curve of method search is shown in Figure 2. The Gantt diagram of the optimal solution obtained is shown in Figure 3.

4.3. Comparison of the Results

The results of the example show that it is difficult to get a better solution after a certain number of iterations. A better initial solution should be chosen and selection strategy and aspiration level should be set to be more reasonable. In this study, we choose to simply limit the number of iterations and the number of search neighborhood solutions, and the tabu length increases with the number of iterations.

In order to validate the effectiveness of this method, three scales of problems, 72×160 (primary case), 135×300 (intermediate case), and 360×800 (advanced case), are also considered in this study [53]. Distances between engineers and customers, distances between customers and customers, and service time are randomly obtained in [1, 5]. Customers’ weights are randomly obtained in [1, 2]. The parameters are set as in Table 6, and the calculations are as in Table 7.

As can be seen from Table 7, tabu search method performs very well in whatever solving small-, medium-, or large-scale problems. Because the number of iterations and the number of search constraints of neighborhood solutions are set higher, better solutions can be obtained. In this study, the historical search solution was set as tabu object, and the desire level was set as the number of limiting neighborhood solutions. Tabu objects and aspiration levels are both easy to understand and easy to apply.

4.4. Comparison with Simulated Annealing Algorithm

Simulated annealing mainly focuses on global searching [53]. In this part, we compare the tabu search method with simulated annealing algorithm. After that, the further discussion of the two methods is proposed. The searching processes are shown in Figures 4–6.

In simulated annealing algorithm, we set original temperature to 100, final temperature to 10, and cooling temperature function to t = t/(1 + 0.005t) [53]. In Figures 4–6, tabu search method performs much better than simulated annealing algorithm under all three cases. Under the three cases, simulated annealing algorithm was trapped in the local optimal solution, while tabu search method could find the global optimal solution. This is because simulated annealing algorithm searches under certain probability. Therefore, simulated annealing algorithm has little chance to obtain the global optimum. The search efficiency of tabu search method is very high. So the tabu search method is the better option.

5. Discussion and Conclusion

The results show that it is difficult to get a better solution after a certain number of iterations. Tabu search method and analog degradation method both depend heavily on the performance of the initial solution. So a better initial solution should be chosen and tabu strategy and desire level should be set to be more reasonable. In this study, we choose to simply limit the number of iterations and the number of search neighborhood solutions, and the tabu length increases with the number of iterations.

Multicustomer product service scheduling problem with service matching is a complex multiple traveling salesman problem. Service matching needs to be considered in this problem; that is, different types of services required by different customers are different, and different engineers have different service capabilities for different types of services. This study also considered minimizing distance, waiting time, and completion time of weighted customers as optimization objectives. Further studies can consider adding time windows and other constraints.

Tabu search method is used to solve multicustomer product service scheduling problem with service matching in this paper. The biggest characteristic of tabu search method is that it can accept inferior solutions, so that it can avoid falling into local optimum. Therefore, the tabu search method cannot take local optimum as the stopping rule. It needs to set the number of iterations or other stopping rules. The two core problems of tabu search method are setting tabu strategy and desire level, so solving these two problems can easily achieve global optimization.

Data Availability

The data used to support the findings of this study are included within the article.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This study was supported by the Department of Education of Liaoning Province, China (Grant no. w2015310).

References

D. Lesaint, C. Voudouris, and N. Azarmi, “Dynamic workforce scheduling for British Telecommunications plc,” Interfaces, vol. 30, no. 1, pp. 45–56, 2000.
View at: Publisher Site | Google Scholar
E. Wacholder, J. Han, and R. C. Mann, “A neural network algorithm for the multiple traveling salesmen problem,” Biological Cybernetics, vol. 61, no. 1, pp. 11–19, 1989.
View at: Publisher Site | Google Scholar
S. Samerkae, M. Abdolhamid, and E. Takao, “Competition-based neural network for the multiple travelling salesmen problem with minmax objective,” Computer and Operation Research, vol. 26, no. 4, pp. 395–407, 1999.
View at: Google Scholar
B. Ombuki, B. J. Ross, and F. Hanshar, “Multi-objective genetic algorithms for vehicle routing problem with time windows,” Applied Intelligence, vol. 24, no. 1, pp. 17–30, 2006.
View at: Publisher Site | Google Scholar
A. Singh and A. S. Baghel, “A new grouping genetic algorithm approach to the multiple traveling salesperson problem,” Soft Computing, vol. 13, no. 1, pp. 95–101, 2009.
View at: Publisher Site | Google Scholar
E. Kivelevitch, K. Cohen, and M. Kumar, “A market-based solution to the multiple traveling salesmen problem,” Journal of Intelligent and Robotic Systems, vol. 72, no. 1, pp. 21–40, 2013.
View at: Publisher Site | Google Scholar
D. Kai, J. Pingyu, and Z. Mei, “Environmental and economic sustainability-aware resource service scheduling for industrial product service systems,” Journal of Intelligent Manufacturing, vol. 28, no. 6, pp. 1303–1316, 2017.
View at: Publisher Site | Google Scholar
C. Changdar, R. K. Pal, and G. S. Mahapatra, “A genetic ant colony optimization based algorithm for solid multiple travelling salesmen problem in fuzzy rough environment,” Soft Computing, vol. 21, no. 16, pp. 4661–4675, 2017.
View at: Publisher Site | Google Scholar
W. Yongzhen, C. Yan, and L. Yan, “Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem,” Computer and Industrial Engineering, vol. 106, pp. 105–122, 2017.
View at: Publisher Site | Google Scholar
O. Bellenguez-Morineau and E. Néron, “A branch-and-bound method for solving multi-skill project scheduling problem,” RAIRO—Operations Research, vol. 41, no. 2, pp. 155–170, 2007.
View at: Publisher Site | Google Scholar
M. Caramia and S. Giordani, “A new approach for scheduling independent tasks with multiple modes,” Journal of Heuristics, vol. 15, no. 4, pp. 313–329, 2009.
View at: Publisher Site | Google Scholar
M. Yousefikhoshbakht, F. Didehvar, and F. Rahmati, “Modification of the ant colony optimization for solving the multiple traveling salesman problem,” Romanian Journal of Information Science and Technology, vol. 16, no. 1, pp. 65–80, 2013.
View at: Google Scholar
S. Singh and M. E. Aslam Lodhi, “Comparison study of multiple traveling salesmen problem using genetic algorithm,” IOSR Journal of Computer Engineering, vol. 13, no. 3, pp. 17–22, 2013.
View at: Publisher Site | Google Scholar
S. Yuan, B. Skinner, S. Huang, and D. Liu, “A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms,” European Journal of Operational Research, vol. 228, no. 1, pp. 72–82, 2013.
View at: Publisher Site | Google Scholar
R. Ponraj and G. Amalanathan, “Optimizing multiple travelling salesman problem considering the road capacity,” Journal of Computer Science, vol. 10, no. 4, pp. 680–688, 2014.
View at: Publisher Site | Google Scholar
S. H. Chen, “Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem,” Mathematical Problems in Engineering, vol. 2015, Article ID 640231, 13 pages, 2015.
View at: Publisher Site | Google Scholar
R. I. Bolaños, M. G. Echeverry, and J. W. Escobar, “A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the multiple traveling salesman problem,” Decision Science Letters, vol. 4, no. 4, pp. 559–568, 2015.
View at: Publisher Site | Google Scholar
L. Kota and K. Jarmai, “Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming,” Applied Mathematical Modelling, vol. 39, no. 12, pp. 3410–3433, 2015.
View at: Publisher Site | Google Scholar
M. Shabanpour, M. Yadollahi, and M. M. Hasani, “A new method to solve the multi traveling salesman problem with the combination of genetic algorithm and clustering technique,” International Journal of Computer Science and Network Security, vol. 17, no. 5, pp. 221–230, 2017.
View at: Google Scholar
T. Kalmár-Nagy, G. Giardini, and B. D. Bak, “The multiagent planning problem,” Complexity, vol. 2017, Article ID 3813912, 12 pages, 2017.
View at: Publisher Site | Google Scholar
C. Xinye, Z. Ping, D. Guanglong, and L. Fang, “Ant colony optimization based memetic algorithm to solve bi-objective multiple traveling salesmen problem for multi-robot systems,” IEEE Access, vol. 6, pp. 21745–21757, 2018.
View at: Google Scholar
D. J. Castelino, S. Hurley, and N. M. Stephens, “A tabu search algorithm for frequency assignment,” Annals of Operations Research, vol. 63, no. 2, pp. 301–319, 1996.
View at: Publisher Site | Google Scholar
D. Alcaide, J. Sicilia, and D. Vigo, “A tabu search algorithm for the open shop problem,” Top, vol. 5, no. 2, pp. 283–296, 1997.
View at: Publisher Site | Google Scholar
S. G. Ponnambalam, P. Aravindan, and S. V. Rajesh, “A tabu search algorithm for job shop scheduling,” The International Journal of Advanced Manufacturing Technology, vol. 16, no. 10, pp. 765–771, 2000.
View at: Publisher Site | Google Scholar
A. Girard, B. Sansò, and L. Dadjo, “A tabu search algorithm for access network design,” Annals of Operations Research, vol. 106, no. 1–4, pp. 229–262, 2001.
View at: Publisher Site | Google Scholar
R. Alvarez-Valdfes, F. Parrefio, and J. M. Tamarit, “A tabu search algorithm for assigning teachers to courses,” Top, vol. 10, no. 2, pp. 239–259, 2002.
View at: Google Scholar
H. J. Shin, C.-O. Kim, and S. S. Kim, “A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times,” The International Journal of Advanced Manufacturing Technology, vol. 19, no. 11, pp. 859–866, 2002.
View at: Publisher Site | Google Scholar
R. Alvarez-Valdes, F. Parreño, and J. M. Tamarit, “A tabu search algorithm for the pallet loading problem,” OR Spectrum, vol. 27, no. 1, pp. 43–61, 2005.
View at: Publisher Site | Google Scholar
M. Saidi-Mehrabad and P. Fattahi, “Flexible job shop scheduling with tabu search algorithms,” International Journal of Advanced Manufacturing Technology, vol. 32, no. 5-6, pp. 563–570, 2007.
View at: Publisher Site | Google Scholar
U. Özcan and B. Toklu, “A tabu search algorithm for two-sided assembly line balancing,” International Journal of Advanced Manufacturing Technology, vol. 43, no. 7-8, pp. 822–829, 2009.
View at: Publisher Site | Google Scholar
X. Kailiang, F. Zuren, and J. Keliang, “A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates,” Computers and Operations Research, vol. 37, no. 11, pp. 1924–1938, 2010.
View at: Google Scholar
L.-M. Liao and C.-J. Huang, “Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness,” Applied Mathematics and Computation, vol. 217, no. 2, pp. 557–567, 2010.
View at: Publisher Site | Google Scholar
A. Y. Abdelaziz, F. M. Mohamed, S. F. Mekhamer, and M. A. L. Badr, “Distribution system reconfiguration using a modified Tabu Search algorithm,” Electric Power Systems Research, vol. 80, no. 8, pp. 943–953, 2010.
View at: Publisher Site | Google Scholar
A. L. Shiguemoto and V. A. Armentano, “A tabu search procedure for coordinating production, inventory and distribution routing problems,” International Transactions in Operational Research, vol. 17, no. 2, pp. 179–195, 2010.
View at: Publisher Site | Google Scholar
M.-C. Bolduc, G. Laporte, J. Renaud, and F. F. Boctor, “A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars,” European Journal of Operational Research, vol. 202, no. 1, pp. 122–130, 2010.
View at: Publisher Site | Google Scholar
V. A. Armentano, A. L. Shiguemoto, and A. Løkketangen, “Tabu search with path relinking for an integrated production-distribution problem,” Computers & Operations Research, vol. 38, no. 8, pp. 1199–1209, 2011.
View at: Publisher Site | Google Scholar
L.-M. Liao and C.-J. Huang, “Tabu search heuristic for two-machine flowshop with batch processing machines,” Computers & Industrial Engineering, vol. 60, no. 3, pp. 426–432, 2011.
View at: Publisher Site | Google Scholar
J. Kil-Woong, “A tabu search algorithm for routing optimization in mobile ad-hoc networks,” Telecommunication Systems, vol. 51, no. 2-3, pp. 177–191, 2012.
View at: Google Scholar
A. Kasperski, M. Makuchowski, and P. Zieliński, “A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data,” Journal of Heuristics, vol. 18, no. 4, pp. 593–625, 2012.
View at: Publisher Site | Google Scholar
A. Lamghari and R. Dimitrakopoulos, “A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty,” European Journal of Operational Research, vol. 222, no. 3, pp. 642–652, 2012.
View at: Publisher Site | Google Scholar
M. A. González, C. R. Vela, I. González-Rodríguez, and R. Varela, “Lateness minimization with tabu search for job shop scheduling problem with sequence dependent setup times,” Journal of Intelligent Manufacturing, vol. 24, no. 4, pp. 741–754, 2013.
View at: Publisher Site | Google Scholar
M. Gallego, M. Laguna, R. Martí, and A. Duarte, “Tabu search with strategic oscillation for the maximally diverse grouping problem,” Journal of the Operational Research Society, vol. 64, no. 5, pp. 724–734, 2013.
View at: Publisher Site | Google Scholar
N. C. Koutsoukis, G. N. Korres, P. S. Georgilakis, and N. M. Manousakis, “Numerical observability method for optimal phasor measurement units placement using recursive tabu search method,” IET Generation, Transmission & Distribution, vol. 7, no. 4, pp. 347–356, 2013.
View at: Publisher Site | Google Scholar
P. K. Nguyen, T. G. Crainic, and M. Toulouse, “A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows,” European Journal of Operational Research, vol. 231, no. 1, pp. 43–56, 2013.
View at: Publisher Site | Google Scholar
S. C. Ho and W. Y. Szeto, “Solving a static repositioning problem in bike-sharing systems using iterated tabu search,” Transportation Research Part E: Logistics and Transportation Review, vol. 69, pp. 180–198, 2014.
View at: Publisher Site | Google Scholar
B. R. P. Junior, A. M. Cossi, J. Contreras, and J. R. S. Mantovani, “Multiobjective multistage distribution system planning using tabu search,” IET Generation, Transmission and Distribution, vol. 8, no. 1, pp. 35–45, 2014.
View at: Publisher Site | Google Scholar
R. Liu, X. Xie, and T. Garaix, “Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics,” Omega, vol. 47, pp. 17–32, 2014.
View at: Publisher Site | Google Scholar
B. Yao, P. Hu, M. Zhang, and M. Jin, “A support vector machine with the tabu search algorithm for freeway incident detection,” International Journal of Applied Mathematics and Computer Science, vol. 24, no. 2, pp. 397–404, 2014.
View at: Publisher Site | Google Scholar
X. Li, F. Baki, P. Tian, and B. A. Chaouch, “A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing,” Omega, vol. 42, no. 1, pp. 75–87, 2014.
View at: Publisher Site | Google Scholar
C. Buyang, G. Fred, and R. Cesar, “A tabu search algorithm for cohesive clustering problems,” Journal of Heuristics, vol. 21, no. 4, pp. 457–477, 2015.
View at: Publisher Site | Google Scholar
M. Alshibli, A. El Sayed, E. Kongar, T. M. Sobh, and S. M. Gupta, “Disassembly sequencing using tabu search,” Journal of Intelligent and Robotic Systems, vol. 82, no. 1, pp. 69–79, 2016.
View at: Publisher Site | Google Scholar
J. Jun-jie and W. Li-ya, “Field product service scheduling with service matching based on genetic algorithm,” Computer Integrated Manufacturing Systems, vol. 18, no. 11, pp. 2573–2577, 2012, in Chinese.
View at: Google Scholar
Y. Dong, J. Wang, F. Chen, Y. Hu, and Y. Deng, “Location of facility based on simulated annealing and ‘ZKW’ algorithms,” Mathematical Problems in Engineering, vol. 2017, Article ID 4628501, 9 pages, 2017.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2020 Liu Cheng Hao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies