id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_o226xx3labcrbpre5mmuxnyeuu	Olli Bräysy	The mixed capacitated general routing problem with turn penalties	2011	33	.pdf	application/pdf	11751	1256	91	capacitated general routing problem with turn penalties. Keywords: Vehicle routing, capacitated general routing problem, turn penalties, So far research on extended vehicle routing models with turn penalties and forbidden et al (2001), Corberán et al (2002) and Soler et al (2008), that generalize several wellknown single vehicle routing problems to the existence of turn penalties. General Routing Problem (MGRP) with turn penalties, that includes all the cases is an arc routing problem, in which a fleet of vehicles (with a known capacity) is based solving capacitated routing problems with turn penalties, through suggesting a new in polynomial time into a Generalized Vehicle Routing Problem (GVRP). The Mixed Capacitated General Routing Problem with Turn Penalties There is no arc between vertices belonging to the same Si. Given an MCGRPTP in G, we define a GVRP in G∗ where the vertex set V ∗ is	./cache/work_o226xx3labcrbpre5mmuxnyeuu.pdf	./txt/work_o226xx3labcrbpre5mmuxnyeuu.txt