Just-in-Time Orders Delivery Mixed Outsourcing Problem

Abstract:

In a competitive environment, service guarantees would affect customer back-off rate. On time delivery plays an important role on time-based competition. If orders cannot be delivered on time, those orders should be outsourced in order to gain a good reputation. However, if a cargoes distribution company has it own trucks, it would gain more profits if the orders were not outsourced. Thus, JIT orders delivery mixed outsourcing problem (JITMOP) is a difficult decision making problem in a cargoes distribution company. This research constructed a Mixed Integer Programming (MIP) model for maximizing operational profits of the company. The study proposed a Genetic Algorithm with Tabu (GAWT) to solve the model. For validation, the proposed approach was comparing to Random Hybrid Tabu (RHT) and Ransom Search (RS); also found GAWT outperformed RS by an average of 54%. It represented that a cargoes distribution company would gain more than 54% of profits if they schedule orders well, part of orders outsourcing to collaborative companies, and using GAWT heuristics. Future research suggests expanding this research to include more discussion if some assumptions are changed.

• Periodical: Applied Mechanics and Materials (Volumes 220-223)
• Pages: 246-250
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.220-223.246
• Online since: November 2012
• Authors: Zih Ping Ho
• Keywords: Early and Tardy Scheduling Problem, JIT, Orders Delivery, Outsourcing Decision, Vehicle Routing Problem (VRP)

References

[1] C. Duhamel, P. Lacomme , C. Prodhon, A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems, Engi. App. Arti. Intelli. 25 (2012) 345-358.

DOI: 10.1016/j.engappai.2011.10.002

[2] Z. P. Ho, Geographical information of dynamic carbon footprints management system in orders and trucks assignment problem, Adv. Mater. Res. J. In Press (2012).

DOI: 10.4028/www.scientific.net/amr.518-523.5611

[3] Z. P. Ho, Restaurant facilities layout - Reducing carbon footprint aspect, App. Mech. Mater. 58-60 (2011) 618-623.

DOI: 10.4028/www.scientific.net/amm.58-60.618

[4] K. C. Tan, L. H. Lee , K. Ou, Artificial intelligence heuristics in solving vehicle routing problems with time window constraints, Engi. App. Arti. Intelli. 14 (2001) 825-837.

DOI: 10.1016/s0952-1976(02)00011-8

[5] Z. P. Ho, Low-carbon restaurant: Refrigerators energy efficiency aspect, Int. J. Ener. Sci. In Press (2012).

[6] M. U. Ahmed, P. S. Sundararaghavan, Minimizing the weighted sum of late and early completion penalties in a single machine, IIE Trans. 22 (1990) 288-290.

DOI: 10.1080/07408179008964183

[7] Z. Zhu, R. B. Heady, Minimizing the sum of earliness-tardiness in multi-machine scheduling: a mixed integer programming approach, Compu. & Ind. Engi. 38 (2000) 297-305 .

DOI: 10.1016/s0360-8352(00)00048-6

[8] J. S. Davis, J. J. Kanet, Single-machine scheduling with early and tardy completion costs, Nav. Res. Logis. Q. 40 (1993) 85-101.

DOI: 10.1002/1520-6750(199302)40:1<85::aid-nav3220400106>3.0.co;2-c

[9] K. C. So, J. S. Song, Price, delivery time quarantees and capacity selection, Euro. J. Oper. Res. 111 (1998) 28-49.

[10] G. Wan, B. P. C. Yen, Tabu search for single machine scheduling with distinct due windows and weighted earliness and tardiness penalties, Euro. J. Oper. Res. 142 (2002) 271-281.

DOI: 10.1016/s0377-2217(01)00302-2

[11] H. Sun, G. Wang, Parallel machine earliness and tardiness scheduling with proportional weights, Compu. & Oper. Res. 30 (2003) 801-808.

DOI: 10.1016/s0305-0548(02)00055-2

[12] V. P. Nguyen, C. Prins , C. Prodhon, A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem, Engi. App. Arti. Intelli. 25 (2012) 56-71.

DOI: 10.1016/j.engappai.2011.09.012

[13] J. Q. Li, Q. K. Pan , K. Z. Gao, Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems, Int. J. Adv. Manufa. Tech. 55 (2011) 1159-1169.

DOI: 10.1007/s00170-010-3140-2

[14] Z. P. Ho, An application of new approach for dynamic orders selection to maximize restaurant operational profits, Adv. Mater. Res. J. 472-475 (2012) 380-385.

DOI: 10.4028/www.scientific.net/amr.472-475.380

[15] A. Ahmadi, F. Karray , M. S. Kamel, Model order selection for multiple cooperative swarms clustering using stability analysis, Info. Sci. 182 (2012) 169-183.

DOI: 10.1016/j.ins.2010.10.010

[16] L. Davis, Handbook of genetic algorithms, Van Nostrand Reinhold, New York, 1991.

[17] W. Ho, G. T. S. Ho, P. Ji , H. C. W. Lau, A hybrid genetic algorithm for the multi-depot vehicle routing problem, Engi. App. Arti. Intelli. 21 (2008) 548-557.

DOI: 10.1016/j.engappai.2007.06.001