domst.pl.in,v

Lin-Kernighan heuristic for the TSP and minimum weight perfect matching

head	1.2;
access;
symbols
	zero-five-zero:1.2
	zero-four-seventeen:1.2
	zero-four-ten:1.2
	zero-four-nine:1.2
	zero-four-eight:1.2
	zero-four-five:1.2
	zero-four-three:1.1
	zero-four-zero:1.1;
locks
	neto:1.2; strict;
comment	@# @;


1.2
date	98.08.08.00.06.25;	author neto;	state Exp;
branches;
next	1.1;

1.1
date	97.11.20.19.29.49;	author neto;	state Exp;
branches;
next	;


desc
@Perl script to run tspgen with multiplep parameters.
@


1.2
log
@Better in every way.
That's right, I don't care anymore.
@
text
@#! @@PERL@@ -w
# @@configure_input@@
# vi: set ts=2 sw=2:
# domst.pl
# Run tspgen multiple times on the MSTEL of a given instance.
#
# This file is in the public domain, and comes with no warranty.
# David Neto, November 20, 1997.
#
# -j 0.5 .. 1 is interesting when -p is high (4 and above).
# For some reason, tspgen doesn't pay attention to its seed!


$instance = "one500";
$lkprog = "../src/lk";
$tspgen = "../src/tspgen";

@@pl = ("000.0", "000.5", "001.0", "004.0", "100.0");# packing factors. 100 is "tightest"
@@jl = ("0.0", "0.5", "0.7", "0.8", "1.0", "-1");  # join biases -1 is random, 0 is shortest, 1 is longest
@@sl = ("42","50","98");		# seeds
# For some reason, tspgen doesn't pay attention to its seed!
@@sl = ("142");

system("$lkprog -M -S dsort ../data/$instance.tsp >mst");
for $s (@@sl) {
	for $j (@@jl) {
		for $p (@@pl) {
			$sjp = "$s" . "_" . "$j" . "_" . "$p";
			system("$tspgen -s $s -j $j -p $p <mst >mst.$instance.$sjp.tsp");
			system("$lkprog -M --no-round -S dsort <mst.$instance.$sjp.tsp -p mst.$instance.$sjp.ps >/dev/null");
		}
	}
}
@


1.1
log
@Initial revision
@
text
@d14 1
a14 1
$instance = "dsj1000";
d18 1
a18 1
@@pl = ("000.0", "000.5", "001.0", "004.0", "200.0");# packing factors. 200 is "tightest"
d24 1
a24 1
system("$lkprog -m -S dsort ../data/$instance.tsp >mst");
d30 1
a30 1
			system("$lkprog -m --no-round -S dsort <mst.$instance.$sjp.tsp -p mst.$instance.$sjp.ps >/dev/null");
@