Learn More
Particle swarm optimization (PSO) is a heuristic optimization technique based on swarm intelligence that is inspired by the behavior of bird flocking. The canonical PSO has the disadvantage of premature convergence. Several improved PSO versions do well in keeping the diversity of the particles during the searching process, but at the expense of rapid(More)
In today's global free market, third-party logistics providers (3PLs) are becoming increasingly important. This paper studies a problem faced by a 3PL operating a warehouse in Shanghai, China, under contract with a major manufacturer of children's clothing based in the United States. At the warehouse, the 3PL receives textile parcel shipments from the(More)
This paper investigates the manpower allocation problem with time windows and job-teaming constraints (MAPTWTC), a practical scheduling and routing problem that tries to synchronize workers' schedules to complete all tasks. We first provide an integer programming model for the problem and discuss its properties. Next, we show that tree data structure can be(More)
  • Hu Qin, Meifeng Luo, Xiang Gao, Andrew Lim
  • 2011
This paper studies a problem encountered by a buying office for one of the largest retail distributors in the world. An important task for the buying office is to plan the distribution of goods from Asia to various destinations across Europe. The goods are transported along shipping lanes by shipping companies, which offer different discount rates depending(More)
Keywords: Traveling salesman Pickup and delivery Last-in-first-out loading Tree data structure Variable neighborhood search a b s t r a c t The feasible solutions of the traveling salesman problem with pickup and delivery (TSPPD) are commonly represented by vertex lists. However, when the TSPPD is required to follow a policy that loading and unloading(More)