Efficient Heuristics for Single-Source Transportation Problems
International Journal of Applied Physics and Mathematics
This paper develops two efficient heuristics to solve the single-source transportation problem, i.e. the special class of the transportation problem where each customer must be served by only one supplier. The proposed heuristics are both started by simplifying the problem into the simpler transportation problem where each customer requires exact one product lot. Then, the first heuristic solves the simplified problem using the transportation algorithm while the second heuristic solves it using
... tic solves it using the assignment algorithm. The heuristics return an optimal solution or a near-optimal solution for every benchmark instance. He once worked as a teaching assistant in Kasetsart University, and as a senior engineer in Delta Electronics (Thailand). He also served as a lecturer in Sirindhorn International Institute of Technology, and as a senior researcher in M-Focus Company. His currently research interests include operations research, production planning and control, scheduling and sequencing, meta-heuristic algorithms for optimization problems, logistics and supply chain management, and quality control.