@incollection{,
	
					
					
					14E33389F7FF3284A4623DEC89D73559
				,
	author={{Dr. PawanJindal} and {}},
	journal={{Global Journal of Computer Science and Technology}},
	journal={{GJCST}}0975-41720975-435010.34257/gjcst,
	address={Cambridge, United States},
	publisher={Global Journals Organisation}11156572
}

@book{b0,
	
	
		,
	author={{
			EMReingold
		} and {
			JNievergelt
		} and {
			NDeo
		}}
		
		
		,
	title={{Combinatorial Algorithms: Theory and Practice}}
				
			,
	publisher={Prentice-Hall}
			,
	year={1977}
		
	

}

@incollection{b1,
	
	
		,
	title={{A review of scheduling research involving setupconsiderations}}
		,
	author={{
			JAllahverdi
		} and {
			TGupta
		} and {
			Aldowaisan
		}}
		
		
	
	
		,
	journal={{Omega, Int. Journal of Management Science}}
		
			27
			
			,
	year={1999}
		
	

}

@incollection{b2,
	
	
		,
	title={{Resource-constrained geometric network optimization}}
		,
	author={{
			EMArkin
		} and {
			JS BMitchell
		} and {
			GNarasimhan
		}}
		
		
	
	
		,
	booktitle={{Symposium on Computational Geometry}}
				
			,
	year={1998}
			
		
	

}

@incollection{b3,
	
	
		,
	title={{Improved approximation guarantees for minimumweight k-trees and prizecollecting salesmen}}
		,
	author={{
			BAwerbuch
		} and {
			YAzar
		} and {
			ABlum
		} and {
			SVempala
		}}
		
		
		
	
	
		,
	journal={{Siam J. Computing}}
		
			28
			1
			
			,
	year={1999}
		
	

}

@incollection{b4,
	
	
		,
	title={{On approximating a geometric prize-collecting traveling salesman}}
		,
	author={{
			RBar-Yehuda
		} and {
			GEven
		} and {
			SShahar
		}}
		
		
	
	
		,
	booktitle={{Proceedings of the European Symposium on Algorithms}}
				the European Symposium on Algorithms
		
			,
	year={2003}
		
	

}

@incollection{b5,
	
	
		,
	title={{Approximation algorithms for orienteering and discounted-reward tsp}}
		,
	author={{
			SBlum
		} and {
			DChawla
		} and {
			TKarger
		} and {
			ALane
		} and {
			MMeyerson
		} and {
			Minkoff
		}}
		
		
		
		
		
	
	
		,
	booktitle={{Proceedings of the 44th Foundations of Computer Science}}
				the 44th Foundations of Computer Science
		
			,
	year={2003}
		
	

}

@incollection{b6,
	
	
		,
	title={{Complexity of task sequencing with deadlines, set-up times and changeover costs}}
		,
	author={{
			JBruno
		} and {
			PDowney
		}}
		
	
	
		,
	journal={{SIAM Journal on Computing}}
		
			7
			4
			
			,
	year={1978}
		
	

}

@incollection{b7,
	
	
		,
	title={{Approximation algorithms for the traveling repairman and speeding deliveryman problems with unit-time windows}}
		,
	author={{
			GNFrederickson
		} and {
			BWittman
		}}
		
	
	
		,
	booktitle={{Proceedings of APPROX-RANDOM}}
				APPROX-RANDOM
		
			,
	year={2007}
			4627
			
		
	

}

@incollection{b8,
	
	
		,
	title={{A new optimization algorithm for the vehicle routing problem with time windows}}
		,
	author={{
			MDesrochers
		} and {
			JDesrosiers
		} and {
			MSolomon
		}}
		
		
	
	
		,
	journal={{Operations Research}}
		
			40
			
			,
	year={1992}
		
	

}

@incollection{b9,
	
	
		,
	title={{Vehicle routing with time windows: optimization and approximation}}
		,
	author={{
			MDesrochers
		} and {
			JLenstra
		} and {
			MSavelsbergh
		} and {
			FSoumis
		}}
		
		
		
	
	
		,
	booktitle={{Vehicle Routing: Methods and Studies}}
				,
	editor={
			BLGolden
			AAAssad
		}
		North-Holland, Amsterdam
		
			,
	year={1988}
			
		
	

}

@incollection{b10,
	
	
		,
	title={{The orienteering problem}}
		,
	author={{
			BGolden
		} and {
			LLevy
		} and {
			RVohra
		}}
		
		
	
	
		,
	journal={{Naval Research Logistics}}
		
			34
			
			,
	year={1987}
		
	

}

@incollection{b11,
	
	
		,
	title={{Scheduling jobs in a alcan aluminium factory using a genetic algorithm}}
		,
	author={{
			MGravel
		} and {
			WPrice
		} and {
			CGagn
		}}
		
		
	
	
		,
	journal={{International Journal of Production Research}}
		
			38
			13
			
			,
	year={2000}
		
	

}

@incollection{b12,
	
	
		,
	title={{A two-phase genetic algorithm to solve variants of the batch sequencing problem}}
		,
	author={{
			CJordan
		}}
	
	
		,
	journal={{International Journal of Production Research (UK)}}
		
			36
			3
			
			,
	year={1998}
		
	

}

@incollection{b13,
	
	
		,
	title={{The orienteering problem with time windows}}
		,
	author={{
			MKantor
		} and {
			MRosenwein
		}}
		
	
	
		,
	journal={{Journal of the Operational Research Society}}
		
			43
			
			,
	year={1992}
		
	

}

@incollection{b14,
	
	
		,
	title={{A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times}}
		,
	author={{
			YKaruno
		} and {
			HNagamochi
		}}
		
	
	
		,
	booktitle={{Proceedings of the European Symposium on Algorithms}}
				the European Symposium on Algorithms
		
			,
	year={2001}
			
		
	

}

@incollection{b15,
	
	
		,
	title={{Vehicle routing with time windows}}
		,
	author={{
			ARKolen
		} and {
			HKan
		} and {
			Trienekens
		}}
		
		
	
	
		,
	journal={{Operations Research}}
		
			35
			
			,
	year={1987}
		
	

}

@book{b16,
	
	
		,
	title={{Vehicle Routing with Time Windows using Genetic Algorithms, Application Handbook of Genetic Algorithms: New Frontiers}}
		,
	author={{
			SThangiah
		}}
		,
	editor={II. Lance Chambers}
		
			,
	year={1995}
			,
	publisher={CRC Press}
		
	

}

@incollection{b17,
	
	
		,
	title={{Heuristic methods for vehicle routing problem with time windows}}
		,
	author={{
			KTan
		} and {
			LLee
		} and {
			KZhu
		}}
		
		
	
	
		,
	booktitle={{Proceedings of the 6th AI and Math}}
				the 6th AI and Math
		
			,
	year={2000}
		
	

}

@incollection{b18,
	
	
		,
	title={{Local search for routing problems with time windows}}
		,
	author={{
			MSavelsbergh
		}}
	
	
		,
	journal={{Annals of Operations Research}}
		
			4
			
			,
	year={1985}
		
	

}

@incollection{b19,
	
	
		,
	title={{Algorithms for the vehicle routing problems with time deadlines}}
		,
	author={{
			SRThangiah
		} and {
			IHOsman
		} and {
			RVinayagamoorthy
		} and {
			TSun
		}}
		
		
		
	
	
		,
	journal={{American Journal of Mathematical and Management Sciences}}
		
			13
			3&4
			
			,
	year={1993}
		
	

}

@incollection{b20,
	
	
		,
	title={{Special cases of traveling salesman and repairman problems with time windows}}
		,
	author={{
			JTsitsiklis
		}}
	
	
		,
	journal={{Networks}}
		
			22
			
			,
	year={1992}
		
	

}

@incollection{b21,
	
	
		,
	title={{A survey of u.s. manufacturing practices in make-to-order machine shops}}
		,
	author={{
			JWisner
		} and {
			SSiferd
		}}
		
	
	
		,
	journal={{Production and Inventory Management Journal}}
		
			1
			
			,
	year={1995}
		
	

}

@incollection{b22,
	
	
		,
	title={{Survey of scheduling research involving setup times}}
		,
	author={{
			WYang
		} and {
			CLiao
		}}
		
	
	
		,
	journal={{International Journal of Systems Science}}
		
			30
			2
			
			,
	year={1999}
		
	

}

@incollection{b23,
	
	
		,
	title={{Approximation algorithms for deadline-TSP and vehicle routing with time-windows}}
		,
	author={{
			NBansal
		} and {
			ABlum
		} and {
			SChawla
		} and {
			AMeyerson
		}}
		
		
		
	
	
		,
	booktitle={{Proceedings of the 36th Annual ACM Symposium on Theory of Computing}}
				the 36th Annual ACM Symposium on Theory of ComputingNew York, NY, USA
		
			,
	publisher={ACM}
			,
	year={2004}
			
		
	

}

@book{b24,
	
	
		,
	author={{
			RKAhuja
		} and {
			TLMagnanti
		} and {
			JBOrlin
		}}
		
		
		,
	title={{Network Flows: Theory, Algorithms, and Applications}}
				
	

}

@book{b25,
	
	
		,
	title={{}}
		,
	author={{
			PrenticeHall
		}}
		
			,
	year={1993}
			,
	address={Upper Saddle River, New Jersey}
		
	

}

@incollection{b26,
	
	
		,
	title={{Resource-constrained geometric network optimization}}
		,
	author={{
			EMArkin
		} and {
			JS BMitchell
		} and {
			GNarasimhan
		}}
		
		
	
	
		,
	booktitle={{Symposium on Computational Geometry}}
				
			,
	year={1998}
			
		
	

}

@incollection{b27,
	
	
		,
	title={{A 2 + ? approximation algorithm for the k-MST problem}}
		,
	author={{
			SArora
		} and {
			GKarakostas
		}}
		
	
	
		,
	booktitle={{Preliminary version in Proc. of ACM-SIAM SODA}}
				
			,
	year={2006. 2000}
			107
			
		
	

}

@incollection{b28,
	
	
		,
	title={{Improved approximation guarantees for minimumweight k-trees and prizecollecting salesmen}}
		,
	author={{
			BAwerbuch
		} and {
			YAzar
		} and {
			ABlum
		} and {
			SVempala
		}}
		
		
		
	
	
		,
	booktitle={{Proc. of ACM STOC}}
				of ACM STOC
		
			,
	year={1998. 1995}
			28
			
		
	

}

@incollection{b29,
	
	
		,
	title={{The prize collecting traveling salesman problem}}
		,
	author={{
			EBalas
		}}
	
	
		,
	journal={{Networks}}
		
			19
			6
			
			,
	year={1989}
		
	

}

@incollection{b30,
	
	
		,
	title={{On the worst-case performance of some algorithms for the asymmetric traveling salesman problem}}
		,
	author={{
			AMFrieze
		} and {
			GGalbiati
		} and {
			FMaffioli
		}}
		
		
	
	
		,
	journal={{Networks}}
		
			12
			1
			
			,
	year={1982}
		
	

}

@incollection{b31,
	
	
		,
	title={{On approximating a geometric prize-collecting traveling salesman problem with time windows}}
		,
	author={{
			RBar-Yehuda
		} and {
			GEven
		} and {
			SShahar
		}}
		
		
	
	
		,
	booktitle={{Preliminary version in Proc. Of ESA}}
				
			,
	year={2005. 2003}
			55
			
		
	

}

@incollection{b32,
	
	
		,
	title={{A 3-approximation for the minimum tree spanning k vertices}}
		,
	author={{
			NGarg
		}}
	
	
		,
	booktitle={{Proceedings of the 37th Annual Symposium on Foundations of Computer Science}}
				the 37th Annual Symposium on Foundations of Computer Science
		
			,
	publisher={IEEE Computer Society}
			,
	year={1996}
			
		
	

}

@incollection{b33,
	
	
		,
	title={{A Constant-Factor Approximation Algorithm for the k-MST Problem}}
		,
	author={{
			RBlum
		} and {
			SRavi
		} and {
			Vempala
		}}
		
		
	
	
		,
	booktitle={{Preliminary version in Proc. Of ACMSTOC}}
				
			,
	year={1999. 1996}
			58
			
		
	

}

@incollection{b34,
	
	
		,
	title={{Paths, trees, and minimum latency tours}}
		,
	author={{
			KChaudhuri
		} and {
			BGodfrey
		} and {
			SRao
		} and {
			KTalwar
		}}
		
		
		
	
	
		,
	booktitle={{44th Annual Symposium on Foundations of Computer Science}}
				
			,
	publisher={IEEE Computer Society}
			,
	year={2003}
			
		
	

}

@incollection{b35,
	
	
		,
	title={{Maximum coverage problem with group budget constraints and applications}}
		,
	author={{
			CChekuri
		} and {
			AKumar
		}}
		
	
	
		,
	booktitle={{Proceedings of APPROXRANDOM}}
				APPROXRANDOM
		
			,
	year={2004}
			
		
	

}

@incollection{b36,
	
	
		,
	title={{A recursive greedy algorithm for walks in directed graphs}}
		,
	author={{
			CChekuri
		} and {
			M
		}}
		
	
	
		,
	booktitle={{Proceedings of the 46th Annual Symposium on Foundations of Computer Science}}
				the 46th Annual Symposium on Foundations of Computer Science
		
			,
	publisher={IEEE Computer Society}
			,
	year={2005}
			
		
	

}

@incollection{b37,
	
	
		,
	title={{An O(log n) Approximation for the Asymmetric Traveling Salesman Path Problem Theory of Computing}}
		,
	author={{
			CChekuri
		} and {
			M
		}}
		
	
	
		,
	booktitle={{Preliminary version in Proc. of APPROX}}
				
			,
	year={2007. 2005}
			3
			
		
	

}

@incollection{b38,
	
	
		,
	title={{Saving an epsilon: a 2-approximation for the k-MST problem in graphs}}
		,
	author={{
			NGarg
		}}
	
	
		,
	booktitle={{Proceedings of the 37th Annual ACM Symposium on Theory of computing}}
				the 37th Annual ACM Symposium on Theory of computing
		
			,
	publisher={ACM}
			,
	year={2005}
			
		
	

}

@incollection{b39,
	
	
		,
	title={{A general approximation technique for constrained forest problems}}
		,
	author={{
			MXGoemans
		} and {
			DPWilliamson
		}}
		
	
	
		,
	journal={{SIAM Journal on Computing}}
		
			24
			
			,
	year={1995}
		
	

}

@incollection{b40,
	
	
		,
	title={{The orienteering problem}}
		,
	author={{
			BLGolden
		} and {
			LLevy
		} and {
			RVohra
		}}
		
		
	
	
		,
	journal={{Naval Research Logistics}}
		
			34
			3
			
			,
	year={1987}
		
	

}

@book{b41,
	
	
		,
	title={{The traveling salesman problem and its variations}}
		,
	author={{
			GGutin
		} and {
			APPunnen
		}}
		
		
			,
	year={2002}
			,
	publisher={Springer}
			,
	address={Berlin}
		
	

}

@book{b42,
	
	
		,
	title={{Improved Algorithms for Orienteering and Related Problems}}
		,
	author={{
			CChekuri
		} and {
			NKorula
		} and {
			MP´al
		}}
		
		
		
	

}

@book{b43,
	
	
		,
	title={{Proc. of ACM-SIAM SODA}}
				of ACM-SIAM SODA
		
			,
	year={January 2008}
		
	

}

@incollection{b44,
	
	
		,
	title={{Nagarajan and R. Ravi. Poly-logarithmic approximation algorithms for directed vehicle routing problems}}
		,
	author={{
			ELLawler
		} and {
			AH GKan
		} and {
			JKLenstra
		} and {
			DBShmoys
		}}
		
		
		
	
	
		,
	booktitle={{Proceedings of APPROXRANDOM}}
				APPROXRANDOM
		
			,
	publisher={John Wiley & Sons Inc}
			,
	year={1985. 2007}
			44
			
		
	
	,
	note={The Traveling salesman problem: a guided tour of combinatorial optimization}

}

@book{b45,
	
	
		,
	author={{
			PToth
		} and {
			DVigo
		}}
		
		,
	title={{The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial Mathematics}}
				Philadelphia PA
		
			,
	year={2001}
		
	

}

@incollection{b46,
	
	
		,
	title={{Special cases of traveling salesman and repairman problems with time windows}}
		,
	author={{
			JNTsitsiklis
		}}
	
	
		,
	journal={{Networks}}
		
			22
			3
			
			,
	year={1992}
		
	

}

@incollection{b47,
	
	
		,
	title={{The orienteering problem in the plane revisited}}
		,
	author={{
			KChen
		} and {
			SHar-Peled
		}}
		
	
	
		,
	booktitle={{Preliminary version in Proc. of ACM SoCG}}
				
			,
	year={2008. 2006}
			38
			
		
	

}

@book{b48,
	
	
		,
	title={{Fundamental of Computer Algorithms}}
		,
	author={{
			EHorowitz
		} and {
			SSahni
		}}
		
		
			,
	year={1982}
			,
	publisher={Computer Science Press}
		
	

}

@book{b49,
	
	
		,
	title={{Introduction to Algorithms}}
		,
	author={{
			TCormen
		} and {
			CLeiserson
		} and {
			RRivest
		}}
		
		
		
			,
	year={1991}
			,
	publisher={MIT Press}
		
	

}

@book{b50,
	
	
		,
	title={{The Design and Analysis of Computer Algorithms}}
		,
	author={{
			AVAho
		} and {
			JEHopcroft
		} and {
			JDUllman
		}}
		
		
		
			,
	year={1974}
			,
	publisher={Addison-Wesley}
		
	

}

@incollection{b51,
	
	
		,
	title={{}}
		,
	author={{
			AVAho
		} and {
			JEHopcroft
		} and {
			JDUllman
		}}
		
		
	
	
		,
	journal={{Data Structures and Algorithms}}
		
			,
	year={1984}
			,
	publisher={Addison-Wesley}
		
	

}

@book{b52,
	
	
		,
	title={{Computer Algorithms: Introduction to Design and Analysis}}
		,
	author={{
			SBaase
		}}
		
			,
	year={1988}
			,
	publisher={Addison-Wesley}
		
	

}

@book{b53,
	
	
		,
	title={{Analysis of Algorithms and Data Structures}}
		,
	author={{
			LBanachowski
		} and {
			AKreczmar
		} and {
			WRytter
		}}
		
		
		
			,
	year={1991}
			,
	publisher={Addison-Wesley}
		
	

}

@incollection{b54,
	
	
		,
	title={{Teaching Algorithms}}
		,
	author={{
			RBaeza-Yates
		}}
	
	
		,
	journal={{IV Iberoamerican Congress on Computer Science Education}}
		
			,
	year={July 1995}
		
	

}

@book{b55,
	
	
		,
	title={{Introduction to Distributed Algorithms}}
		,
	author={{
			GTel
		}}
		
		
			Cambridge Univ. Press1995
		
	

}

@book{b56,
	
	
		,
	title={{Algorithmics: Theory and Practice}}
		,
	author={{
			PG-Brassard
		} and {
			Bratley
		}}
		
		
			,
	year={1988}
			,
	publisher={Prentice-Hall}
		
	

}

@incollection{b57,
	
	
		,
	title={{}}
		,
	author={{
			BruceLGolden
		} and {
			ArjangAAssad
		} and {
			EdwardAWasil
		}}
		
		
	
	
		,
	journal={{Introduction. Computers & OR}}
		
			13
			2-3
			
			,
	year={1986}
		
	

}

@book{b58,
	
	
		,
	title={{Vehicle Routing with Time Windows: Optimization and Approximation -Desrochers, Lenstra}}
		
	
	,
	note={et al. -1988}

}

@book{b59,
	
	
		,
	title={{}}
		,
	author={{
			DumasDesrosiers
		}}
		
			,
	year={1995}
		
	

}

@incollection{b60,
	
	
		,
	title={{A unified tabu search heuristic forvehicle routing problems with time windows}}
		,
	author={{
			GCordeau
		} and {
			ALaporte
		} and {
			Mercier
		}}
		
		
	
	
		,
	journal={{Journal of the Operational Research Society}}
		
			52
			
			,
	year={2001}
		
	

}

@book{b61,
	
	
		,
	title={{Parallelization of the Vehicle Routing Problem with TimeWindows}}
		,
	author={{
			JLarsen
		}}
		
			,
	year={1999}
			,
	address={Lyngby, Denmark}
		
		
			Institute of Mathematical Modelling, Technical University of Denmark
		
	
	,
	note={Ph.D. thesis}

}

@book{b62,
	
	
		,
	title={{A Parallel Cutting-Plane Algorithm for the Vehicle Routing Problems with Time Windows}}
		,
	author={{
			WCook
		} and {
			JLRich
		}}
		
		
			,
	year={1999}
			,
	address={Houston, U.S.A}
		
		
			Department of Computational and Applied Mathematics, Rice University
		
	
	,
	note={Working Paper}

}

@book{b63,
	
	
		,
	title={{The vehicle routing problem with multiple use of vehicles}}
		,
	author={{
			BFleischmann
		}}
		
			,
	year={1990}
			,
	address={Universitat Hamburg, Germany}
		
	
	,
	note={Working Paper. Fachbereich Wirtschaftswissenschaften}

}

@incollection{b64,
	
	
		,
	title={{Vehicle routing with multiple use of vehicles}}
		,
	author={{
			EDTaillard
		} and {
			GLaporte
		} and {
			MGendreau
		}}
		
		
	
	
		,
	journal={{Journal of the Operational Research Society}}
		
			47
			
			,
	year={1996}
		
	

}

@incollection{b65,
	
	
		,
	title={{Efficient insertion heuristics for vehicle routing and scheduling problems}}
		,
	author={{
			AMCampbell
		} and {
			MSavelsbergh
		}}
		
	
	
		,
	journal={{Transportation Science}}
		
			38
			3
			
			,
	year={2004}
		
	

}

@incollection{b66,
	
	
		,
	title={{Simulated annealing metaheuristics for the vehicle routing problem with time windows}}
		,
	author={{
			WChiang
		} and {
			RARussell
		}}
		
	
	
		,
	journal={{Annals of Operations Research}}
		
			63
			,
	year={1996}
		
	

}

@book{b67,
	
	
		,
	title={{Vehicle Routing Problem: Models and Solutions Journal of Quality Measurement and Analysis}}
		,
	author={{
			Liong Choong Yeun
		}}
		
			,
	year={2008}
			4
			
		
	
	,
	note={Wan Rosmanira Ismail, Khairuddin Omar2 & Mourad Zirour}

}

@incollection{b68,
	
	
		,
	title={{Excess Travel: Causes, Extent and Consequences}}
		,
	author={{
			GFKing
		} and {
			CFMast
		}}
		
	
	
		,
	journal={{Transportation Research}}
		
			
			,
	year={1997. Record1111}
		
	

}

@incollection{b69,
	
	
		,
	title={{Planning Models for Freight Transportation}}
		,
	author={{
			TGCrainic
		} and {
			GLaporte
		}}
		
	
	
		,
	journal={{European Journal of Operational Research}}
		
			97
			
			,
	year={1997}
		
	

}

@book{b70,
	
	
		,
	title={{Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms}}
		
	

}