%0 Journal Article
	%A Chansiri Singhtaun
	%D 2015
	%J International Journal of Industrial and Manufacturing Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 99, 2015
	%T An Exact Algorithm for Location–Transportation Problems in Humanitarian Relief
	%U https://publications.waset.org/pdf/10000765
	%V 99
	%X This paper proposes a mathematical model and
examines the performance of an exact algorithm for a location–
transportation problems in humanitarian relief. The model determines
the number and location of distribution centers in a relief network,
the amount of relief supplies to be stocked at each distribution center
and the vehicles to take the supplies to meet the needs of disaster
victims under capacity restriction, transportation and budgetary
constraints. The computational experiments are conducted on the
various sizes of problems that are generated. Branch and bound
algorithm is applied for these problems. The results show that this
algorithm can solve problem sizes of up to three candidate locations
with five demand points and one candidate location with up to twenty
demand points without premature termination.

	%P 815 - 819