Christine L. Mumford

Orcid: 0000-0002-4514-0272

Affiliations:
  • Cardiff University, UK


According to our database1, Christine L. Mumford authored at least 46 papers between 1993 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Public transport network optimisation in PTV Visum using selection hyper-heuristics.
Public Transp., 2021

2020
Exact and hyper-heuristic solutions for the distribution-installation problem from the VeRoLog 2019 challenge.
Networks, 2020

2019
An adaptive scaled network for public transport route optimisation.
Public Transp., 2019

Solving urban transit route design problem using selection hyper-heuristics.
Eur. J. Oper. Res., 2019

Optimising bus routes with fixed terminal nodes: comparing hyper-heuristics with NSGAII on realistic transportation networks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

2015
Optimizing the Placement of ITAPs in Wireless Mesh Networks by Implementing HC and SA Algorithms.
Proceedings of the Ad Hoc Networks, 2015

2014
An Exact Dynamic Programming Based Method to Solve Optimisation Problems Using GPUs.
Proceedings of the Second International Symposium on Computing and Networking, 2014

An Improved Multi-objective Algorithm for the Urban Transit Routing Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

Optimising large scale public transport network design problems using mixed-mode parallel multi-objective evolutionary algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2013
Investigating the use of metaheuristics for solving single vehicle routing problems with time-varying traversal costs.
J. Oper. Res. Soc., 2013

New heuristic and evolutionary operators for the multi-objective urban transit routing problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
Constructing initial solutions for the multiple vehicle pickup and delivery problem with time windows.
J. King Saud Univ. Comput. Inf. Sci., 2012

A wide-ranging computational comparison of high-performance graph colouring algorithms.
Comput. Oper. Res., 2012

2011
An evolutionary bi-objective approach to the capacitated facility location problem with cost and CO<sub>2</sub> emissions.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

2010
The single vehicle pickup and delivery problem with time windows: intelligent operators for heuristic and metaheuristic algorithms.
J. Heuristics, 2010

A metaheuristic approach to the urban transit routing problem.
J. Heuristics, 2010

A multiobjective framework for heavily constrained examination timetabling problems.
Ann. Oper. Res., 2010

Solving the One-Commodity Pickup and Delivery Problem Using an Adaptive Hybrid VNS/SA Approach.
Proceedings of the Parallel Problem Solving from Nature, 2010

An adaptive hybrid VNS/SA approach to the one-commodity pickup and delivery problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009
A weight-coded genetic algorithm for the capacitated arc routing problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

The multi-objective uncapacitated facility location problem for green logistics.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

A simple multi-objective optimization algorithm for the urban transit routing problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

2008
An Order Based Memetic Evolutionary Algorithm for Set Partitioning Problems.
Proceedings of the Computational Intelligence: A Compendium, 2008

2007
Single vehicle pickup and delivery with time windows: made to measure genetic encoding and operators.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

An Order Based Evolutionary Approach to Dual Objective Examination Timetabling.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

2006
A symmetric convexity measure.
Comput. Vis. Image Underst., 2006

New Order-Based Crossovers for the Graph Coloring Problem.
Proceedings of the Parallel Problem Solving from Nature, 2006

2005
A hierarchical solve-and-merge framework for multi-objective optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

Capacitated vehicle routing: perturbing the landscape to fool an algorithm.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

Comparing algorithms, representations and operators for the multi-objective knapsack problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

A Simple Approach to Evolutionary Multiobjective Optimization.
Proceedings of the Evolutionary Multiobjective Optimization, 2005

2004
Developing an aCe Solution for Two-Dimensional Strip Packing.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Simple Population Replacement Strategies for a Steady-State Multi-objective Evolutionary Algorithm.
Proceedings of the Genetic and Evolutionary Computation, 2004

A hierarchical evolutionary approach to multi-objective optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2004

2003
Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2003

2002
VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions.
IEEE Trans. Evol. Comput., 2002

A simple evolutionary algorithm for multi-objective optimization (SEAMO).
Proceedings of the 2002 Congress on Evolutionary Computation, 2002

2001
A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation.
J. Heuristics, 2001

Data set generation for rectangular placement problems.
Eur. J. Oper. Res., 2001

2000
A Genetic Algorithm for VLSI Floorplanning.
Proceedings of the Parallel Problem Solving from Nature, 2000

1998
A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment.
Proceedings of the Parallel Problem Solving from Nature, 1998

1997
Improving Heuristic Algorithms for the Travelling Salesman Problem by Using a Genetic Algorithm to Perturb the Cities.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

Breeding Permutations for Minimum Span Frequency Assignment.
Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 1997

Breeding Perturbed City Coordinates and Fooling Travelling Salesman Heuristic Algorithms.
Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 1997

1995
Adaptive Learning of Process Control and Profit Optimisation using a Classifier System.
Evol. Comput., 1995

1993
Evolutionary Divide and Conquer (I): A Novel Genetic Approach to the TSP.
Evol. Comput., 1993


  Loading...